On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Two results on the list update problem
Information Processing Letters
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On-line Steiner trees in the Euclidean plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Page migration algorithms using work functions
Journal of Algorithms
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line learning and the metrical task system problem
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Unfair problems and randomized algorithms for metrical task systems
Information and Computation
Online algorithms for page replication in rings
Theoretical Computer Science
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
New On-Line Algorithms for the Page Replication Problem
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
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
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We study the online page replication problem. We present a new randomized online algorithm for rings which is 2.37297-competitive, improving the best previous result of 3.16396. We also show that no randomized online algorithm is better than 1.75037-competitive on the ring; previously, only a 1.58198 bound for a single edge was known. We extend the problem in several new directions: continuous metrics, variable size requests, and replication before service. This yields simplified proofs of several known results.