Amortized efficiency of list update and paging rules
Communications of the ACM
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Distributed paging for general networks
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
SIAM Journal on Computing
Page Migration Algorithms Using Work Functions
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Dynamic page migration under brownian motion
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Improved algorithms for dynamic page migration
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. During runtime, the processors access a unit of data from the page, and the system is allowed to migrate the page between the processors. The problem is to compute (on-line) a schedule of page movements to minimize the total communication cost.The Dynamic Page Migration problem is an extension to the page migration. It attempts to model the network dynamics, occurring, for example, in mobile networks. However, the pace of changes is restricted, i.e. the distances between processors can change only by a constant per round. The movement of the nodes induce changes in the communication cost between each pair of nodes, which is proportional to the distance between them raised to some power α. This is typical for mobile wireless networks, where nodes can move with a constant speed, and the cost of communication is measured in terms of energy used for sending the data. Thus, by setting α equal to the propagation exponent of the medium, cost minimization becomes minimizing the total energy consumption in the system.However, as proven in [7], if both network mobility and request sequence are created by an adversary, then the competitive ratio is polynomially large in D and in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we consider a scenario in which the network mobility is adversarial, but the requests are generated randomly by a stochastic process. We design an algorithm MTFR for this scenario, and prove that it is O(1)-competitive, on expectation and with high probability.