Skip to main content
SpringerLink
Log in

A General Decomposition Theorem for the k-Server Problem

  • Conference paper
  • First Online:
Book cover Algorithms — ESA 2001 (ESA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2161))

Included in the following conference series:

Abstract

The first general decomposition theorem for the k-server problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))-competitive randomized algorithms for certain metric spaces consisting of a polylogarithmic number of widely separated sub-spaces, and takes a first step towards a general O(polylog(k))-competitive algorithm. The only other cases for which polylogarithmic competitive randomized algorithms are known are the uniform metric space, and the weighted cache metric space with two weights.

This research was partially supported by an LSU Council on Research summer stipend and by the Research Competitiveness Subprogram of the Louisiana Board of Regents.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartal, Y. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (1996), pp. 183–193.

    Google Scholar 

  2. Bartal, Y. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th ACM Symposium on Theory of Computing (1998), pp. 161–168.

    Google Scholar 

  3. Bartal, Y., Blum, A., Burch, C., AND Tomkins, A. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the 29th ACM Symposium on Theory of Computing (1997), pp. 711–719.

    Google Scholar 

  4. Bartal, Y., Bollobas, B., AND Mendel, M. Ramsey-type theorems for metric spaces and their application for metrical task systems. Manuscript, 2001.

    Google Scholar 

  5. Bartal, Y., Chrobak, M., AND Larmore, L. L. A randomized algorithm for two servers on the line. Information and Computation 158, 1 (Apr 2000), 53–69.

    Google Scholar 

  6. Bein, W., Chrobak, M., AND Larmore, L. The 3-server problem in the plane. In Proceedings of the 7th Annual European Symposium on Algorithms (Jul 1999), pp. 301–312.

    Google Scholar 

  7. Ben-David, S., Borodin, A., Karp, R., Tardos, G., AND Wigderson, A. On the power of randomization in on-line algorithms. Algorithmica 11,1 (Jan 1994), 2–14.

    Google Scholar 

  8. Blum, A., Burch, C., AND Kalai, A. Finely-competitive paging. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (1999), pp. 450–457.

    Google Scholar 

  9. Blum, A., Karloff, H., Rabani, Y., AND Saks, M. A decomposition theorem for task systems and bounds for randomized server problems. SIAM Journal on Computing 30,5 (Dec 2000), 1624–1661.

    Google Scholar 

  10. Borodin, A., AND El-Yaniv, R. Online Computation and Competitive Analysis. Cambridge University Press, 1998.

    Google Scholar 

  11. Borodin, A., Linial, N., AND Saks, M. An optimal online algorithm for metrical task systems. Journal of the ACM 39,4 (Oct 1992), 745–763.

    Google Scholar 

  12. Chrobak, M., Karloff, H., Payne, T., AND Vishwanathan, S. New results on server problems. SIAM Journal on Discrete Mathematics 4,2 (May 1991), 172–181.

    Google Scholar 

  13. Hrobak, M., AND Larmore, L. An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing 20, 1 (Feb 1991), 144–148.

    Google Scholar 

  14. Chrobak, M., AND Larmore, L. L. Server problems and on-line games. In Proceedings of the DIMACS Workshop on On-line Algorithms (Feb 1991), pp. 11–64.

    Google Scholar 

  15. Chrobak, M., Larmore, L. L., Llund, C., AND Reingold, N. A better lower bound on the competitive ratio of the randomized 2-server problem. Information Processing Letters 63,2 (1997), 79–83.

    Article  MathSciNet  Google Scholar 

  16. Fiat, A., Karp, R., Luby, M., Mgeoch, L., Sleator, D., AND Young, N. Competitive paging algorithms. Journal of Algorithms 12,4 (Dec 1991), 685–699.

    Article  MATH  Google Scholar 

  17. Fiat, A., AND Mendel, M. Better algorithms for unfair metrical task systems and applications. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (May 2000), pp. 725–734.

    Google Scholar 

  18. Fiat, A., AND Woeginger, G., Eds. On-Line Algorithms—The State of the Art. Lecture Notes in Computer Science. Springer-Verlag, 1998.

    Google Scholar 

  19. Irani, S. Randomized weighted caching with two page weights. Manuscript, 1999.

    Google Scholar 

  20. Karlin, A., Manasse, M., Mcgeoch, L., AND Owicki, S. Competitive randomized algorithms for nonuniform problems. Algorithmica 11,6 (Jun 1994), 542–571.

    Google Scholar 

  21. Karloff, H., Rabani, Y., AND Ravid, Y. Lower bounds for randomized k-server and motion-planning algorithms. SIAM Journal on Computing 23,2 (Apr 1994), 293–312.

    Google Scholar 

  22. Koutsoupias, E., AND Apadimitriou, C. On the k-server conjecture. Journal of the ACM 42 (1995), 971–983.

    Article  MATH  Google Scholar 

  23. Koutsoupias, E., AND Papadimitriou, C. The 2-evader problem. Information Processing Letters 57,5 (Mar 1996), 249–252.

    Google Scholar 

  24. Manasse, M., Mcgeoch, L., AND Sleator, D. Competitive algorithms for server problems. Journal of Algorithms 11,2 (Jun 1990), 208–230.

    Google Scholar 

  25. Mcgeoch, L., AND Sleator, D. A strongly competitive randomized paging algorithm. Algorithmica 6,6 (1991), 816–825.

    Article  MATH  MathSciNet  Google Scholar 

  26. Seiden, S. S. Unfair problems and randomized algorithms for metrical task systems. Information and Computation 148,2 (Feb 1999), 219–240.

    Google Scholar 

  27. Sleator, D., AND Tarjan, R. Amortized efficiency of list update and paging rules. Communications of the ACM 28,2 (Feb 1985), 202–208.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science 298 Coates Hall, Louisiana State University, Baton Rouge, LA, 70803, USA

    Steven S. Seiden

Authors
  1. Steven S. Seiden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, 33095, Paderborn, Germany

    Friedhelm Meyer auf der Heide

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Seiden, S.S. (2001). A General Decomposition Theorem for the k-Server Problem. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44676-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42493-2

  • Online ISBN: 978-3-540-44676-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation