The weighted 2-server problem

We consider a generalization of the 2-server problem in which servers have different costs. We prove that, in uniform spaces, a version of the work function algorithm is 5-competitive, and that no better ratio is possible. We also give a 5-competitive randomized, memoryless algorithm for uniform spaces, and a matching lower bound.For arbitrary metric spaces, in contrast with the non-weighted case, we prove that there is no memoryless randomized algorithm with finite competitive ratio. We also propose a version of the problem in which a request specifies two points to be covered by the servers, and the algorithm must decide which server to move to which point. For this version, we show a 9-competitive algorithm and we prove that no better ratio is possible.

[1]  Christos H. Papadimitriou,et al.  The 2-Evader Problem , 1996, Inf. Process. Lett..

[2]  Ricardo A. Baeza-Yates,et al.  Searching with Uncertainty (Extended Abstract) , 1988, SWAT.

[3]  Marek Chrobak,et al.  An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..

[4]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[5]  Allan Borodin,et al.  On the power of randomization in on-line algorithms , 2005, Algorithmica.

[6]  Marek Chrobak,et al.  New results on server problems , 1991, SODA '90.

[7]  Marek Chrobak,et al.  A Randomized Algorithm for Two Servers on the Line , 2000, Inf. Comput..

[8]  Marek Chrobak,et al.  The Weighted 2-Server Problem , 2000, STACS.

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

[10]  David Scot Taylor,et al.  The CNN problem and other k-server variants , 2000, Theor. Comput. Sci..

[11]  Leah Epstein,et al.  More on weighted servers or FIFO is better than LRU , 2003, Theor. Comput. Sci..

[12]  Amos Fiat,et al.  Competitive algorithms for the weighted server problem , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

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

[14]  Marek Chrobak,et al.  On Fast Algorithms for Two Servers , 1991, J. Algorithms.

[15]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[16]  Evangelos Kranakis,et al.  Searching with Uncertainty , 1999, SIROCCO.

[17]  Marek Chrobak,et al.  A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem , 1997, Inf. Process. Lett..

[18]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[19]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

[20]  Leen Stougie,et al.  A Competitive Algorithm for the General 2-Server Problem , 2003, ICALP.

[21]  Marek Chrobak,et al.  A Randomized Algorithm for Two Servers on the Line (Extended Abstract) , 1998, ESA.

[22]  Edward F. Grove,et al.  The harmonic k-server algorithm is competitive , 2000, JACM.

[23]  Marek Chrobak,et al.  The Server Problem and On-Line Games , 1991, On-Line Algorithms.

[24]  Marek Chrobak,et al.  Metrical Task Systems, the Server Problem and the Work Function Algorithm , 1996, Online Algorithms.

[25]  Gerhard J. Woeginger,et al.  Online Algorithms , 1998, Lecture Notes in Computer Science.

[26]  Yuval Rabani,et al.  A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems , 2000, SIAM J. Comput..

[27]  Marek Chrobak,et al.  Competive Analysis of Randomized Paging Algorithms , 1996, ESA.

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

[29]  Marek Chrobak,et al.  Competitive analysis of randomized paging algorithms , 2000, Theor. Comput. Sci..

[30]  Yuval Rabani,et al.  A decomposition theorem and bounds for randomized server problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[31]  Lyle A. McGeoch,et al.  A strongly competitive randomized paging algorithm , 1991, Algorithmica.

[32]  Prabhakar Raghavan,et al.  Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.