Metrical Task Systems and the k-Server Problem on HSTs

We consider the randomized k-server problem, and give improved results for various metric spaces. In particular, we extend a recent result of Cote et al [15] for well-separated binary Hierarchically Separated Trees (HSTs) to well-separated d-ary HSTs for poly-logarithmic values of d. One application of this result is an exp(O(√log log k log n))-competitive algorithm for k-server on n uniformly spaced points on a line. This substantially improves upon the prior guarantee of O(min(k, n2/3) for this metric [16]. These results are based on obtaining a refined guarantee for the unfair metrical task systems problem on an HST. Prior to our work, such a guarantee was only known for the case of a uniform metric [5,7,18]. Our results are based on the primal-dual approach for online algorithms. Previous primal-dual approaches in the context of k-server and MTS [2,4,3] worked only for uniform or weighted star metrics, and the main technical contribution here is to extend many of these techniques to work directly on HSTs.

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

[2]  Joseph Naor,et al.  Towards the randomized k-server conjecture: a primal-dual approach , 2010, SODA '10.

[3]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[4]  Joseph Naor,et al.  Randomized Competitive Algorithms for Generalized Caching , 2012, SIAM J. Comput..

[5]  Adam Meyerson,et al.  Randomized k-server on hierarchical binary trees , 2008, STOC.

[6]  Amos Fiat,et al.  Better algorithms for unfair metrical task systems and applications , 2000, STOC '00.

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

[8]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

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

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

[11]  S. Lodha,et al.  A randomized on–line algorithm for the k–server problem on a line , 2006, Random Struct. Algorithms.

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

[13]  Sandy Irani,et al.  Randomized Weighted Caching with Two Page Weights , 2002, Algorithmica.

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

[15]  Sandy Irani,et al.  Page Replacement with Multi-Size Pages and Applications to Web Caching , 2002, Algorithmica.

[16]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[17]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

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

[19]  Yuval Peres,et al.  Mixing Time Power Laws at Criticality , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

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

[22]  Adam Tauman Kalai,et al.  Finely-competitive paging , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[23]  Steven S. Seiden,et al.  A General Decomposition Theorem for the k-Server Problem , 2001, Inf. Comput..

[24]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[25]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).