New results for online page replication

We study the online page replication problem. We present a new randomized algorithm for rings which is 2.37297-competitive, improving the best previous result of 3.16396. We also show that no randomized algorithm is better than 1.75037-competitive on the ring; previously, only a 1.58198 boundfor a single edge was known. We extend the problem in several new directions: continuous metrics, variable size requests, andre plication before service. Finally, we give simplified proofs of several known results.

[1]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[2]  Carsten Lund,et al.  On-Line Distributed Data Management , 1994, ESA.

[3]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

[4]  Wlodzimierz Glazek.  Online algorithms for page replication in rings , 2001, Theor. Comput. Sci..

[5]  Amos Fiat,et al.  Competitive distributed file allocation , 1993, STOC '93.

[6]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[7]  Wlodzimierz Glazek.  Lower and Upper Bounds for the Problem of Page Replication in Ring Networks , 1999, MFCS.

[8]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[9]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[12]  Yuval Rabani,et al.  Competitive algorithms for distributed data management (extended abstract) , 1992, STOC '92.

[13]  Hisashi Koga,et al.  Randomized On-line Algorithms for the Page Replication Problem , 1993, ISAAC.

[14]  Avrim Blum,et al.  On-line Learning and the Metrical Task System Problem , 1997, COLT '97.

[15]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[16]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[17]  Andrew Tomkins,et al.  A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

[18]  WŁodzimierz GŁazek.  Online algorithms for page replication in rings , 2001 .

[19]  Susanne Albers,et al.  New On-Line Algorithms for the Page Replication Problem , 1994, SWAT.

[20]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[21]  Steven S. Seiden,et al.  Unfair Problems and Randomized Algorithms for Metrical Task Systems , 1999, Inf. Comput..

[22]  David L. Black,et al.  Competitive algorithms for replication and migration problems , 1989 .

[23]  Gerhard J. Woeginger,et al.  Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

[24]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[25]  Prof. Dr. Kurt Mehlhorn,et al.  Data Structures and Algorithms 1 , 1984, EATCS.

[26]  Sandy Irani,et al.  Two Results on the List Update Problem , 1991, Inf. Process. Lett..

[27]  Marek Chrobak,et al.  Page Migration Algorithms Using Work Functions , 1993, J. Algorithms.

[28]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[29]  Sandy Irani,et al.  Page replacement with multi-size pages and applications to Web caching , 1997, STOC '97.