A polylogarithmic-competitive algorithm for the k-server problem

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 267-276

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Ma̧dry, Aleksander ^c   Naor, Joseph ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

^c MICROSOFT RESEARCH   (United Kingdom)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

competitive analysis; k server problem; randomized algorithms

Indexed keywords

COMPETITIVE ALGORITHMS; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; FINITE METRIC SPACES; K-SERVER PROBLEM; METRIC SPACES; RANDOMIZED ALGORITHMS;

COMPUTER SCIENCE; SET THEORY; TOPOLOGY;

ALGORITHMS;

EID: 84862635899     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.63     Document Type: Conference Paper

References (26)

1. D. Achlioptas, M. Chrobak, and J. Noga, "Competitive analysis of randomized paging algorithms," Theor. Comput. Sci., vol. 234, no. 1-2, pp. 203-218, 2000.
2. N. Bansal, N. Buchbinder, and J. S. Naor, "A primal-dual randomized algorithm for weighted paging," in FOCS '07: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 507-517.
3. -, "Towards the randomized k-server conjecture: A primal-dual approach," in SODA, 2010.
4. -, "Unfair metrical task systems on hsts and applications," in ICALP, 2010.
5. Y. Bartal, "Probabilistic approximations of metric spaces and its algorithmic applications," in IEEE Symposium on Foundations of Computer Science, 1996, pp. 184-193.
6. -, "On approximating arbitrary metrices by tree metrics," in STOC, 1998, pp. 161-168.
7. Y. Bartal, A. Blum, C. Burch, and A. Tomkins, "A polylog(n)- competitive algorithm for metrical task systems," in Proceedings of the 29th Annual ACM Symposium on Theory of computing, 1997, pp. 711-719.
8. Y. Bartal, B. Bollobás, and M. Mendel, "A ramsy-type theorem for metric spaces and its applications for metrical task systems and related problems," in FOCS, 2001, pp. 396-405.
9. Y. Bartal and E. Grove, "The harmonic -server algorithm is competitive," J. ACM, vol. 47, no. 1, pp. 1-15, 2000.
10. Y. Bartal, N. Linial, M. Mendel, and A. Naor, "On metric ramsey-type phenomena," in STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003, pp. 463-472.
11. A. Blum, H. J. Karloff, Y. Rabani, and M. E. Saks, "A decomposition theorem and bounds for randomized server problems," in FOCS, 1992, pp. 197-207.
12. A. Borodin and R. El-Yaniv, Online computation and competitive analysis. Cambridge University Press, 1998.
13. M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, "New results on server problems," SIAM J. Discret. Math., vol. 4, no. 2, pp. 172-181, 1991.
14. M. Chrobak and L. Larmore, "An optimal on-line algorithm for k-servers on trees," SIAM Journal on Computing, vol. 20, no. 1, pp. 144-?148, 1991.
15. A. Coté, A. Meyerson, and L. Poplawski, "Randomized kserver on hierarchical binary trees," in STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, 2008, pp. 227-234.
16. B. Csaba and S. Lodha, "A randomized on-line algorithm for the k-server problem on a line," Random Structures and Algorithms, vol. 29, no. 1, pp. 82-104, 2006. (Pubitemid 44126449)
17. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003, pp. 448-455.
18. A. Fiat, Y. Rabani, and Y. Ravid, "Competitive k-server algorithms," Journal of Computer and System Sciences, vol. 48, no. 3, pp. 410-428, 1994.
19. A. Fiat, R. M. Karp, M. Luby, L. A. McGeoch, D. D. Sleator, and N. E. Young, "Competitive paging algorithms," J. Algorithms, vol. 12, no. 4, pp. 685-699, 1991.
20. A. Fiat and M. Mendel, "Better algorithms for unfair metrical task systems and applications," SIAM J. Comput., vol. 32, no. 6, pp. 1403-1422, 2003.
21. E. F. Grove, "The harmonic online k-server algorithm is competitive," in STOC, 1991, pp. 260-266.
22. E. Koutsoupias and C. H. Papadimitriou, "On the k-server conjecture," J. ACM, vol. 42, no. 5, pp. 971-983, 1995.
23. M. Manasse, L. McGeoch, and D. Sleator, "Competitive algorithms for server problems," Journal of Algorithms, vol. 11, pp. 208-230, 1990.
24. L. A. McGeoch and D. D. Sleator, "A strongly competitive randomized paging algorithm," Algorithmica, vol. 6, no. 6, pp. 816-825, 1991.
25. S. S. Seiden, "A general decomposition theorem for the kserver problem," in ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms, 2001, pp. 86-97.
26. D. D. Sleator and R. E. Tarjan, "Amortized efficiency of list update and paging rules," Commun. ACM, vol. 28, no. 2, pp. 202-208, 1985.