Amortized efficiency of list update and paging rules
Communications of the ACM
Local Area Network Architectures
Local Area Network Architectures
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Introduction to distributed algorithms
Introduction to distributed algorithms
New on-line algorithms for the page replication problem
Journal of Algorithms
Online algorithms for page replication in rings
Theoretical Computer Science
Randomized On-line Algorithms for the Page Replication Problem
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
New results for online page replication
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Optimal algorithms for page migration in dynamic networks
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We study the problem of page replication in ring networks. The goal is to determine a set of nodes which should contain a page of read-only data in their local memories so that the total cost of accessing data is lowest possible. We prove a lower bound on the competitive ratio of any deterministic on-line algorithm in large uniform rings which approaches 2.31023 as the page size and the number of nodes go to infinity. We present a (3 +√3)/2, 2.36603-competitive deterministic on-line algorithm for the 4-node uniform ring. We also show a matching lower bound for any deterministic on-Une algorithm in this topology. Our results disprove the conjecture of Black and Sleator (1989) for the lower bound of 2.5.