Skip to main content
Springer Nature Link
Log in

New Results for Online Page Replication

  • Conference paper
  • First Online:
Approximation Algorithms for Combinatorial Optimization (APPROX 2000)

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

  • 1180 Accesses

Abstract

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.

This work was done while the authors were at the Max-Planck-Institute for Computer Science, Saarbrücken. Both authors were partially supportedb y the EU ESPRIT LTR Project No. 20244 (ALCOM-IT), WP 3.2. The first author was also supported by a Habilitation Scholarship of the German Research Foundation (DFG).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. S. Albers and H. Koga. New on-line algorithms for the page replication problem. Journal of Algorithms, 27(1):75–96, 1998. A preliminary version was published in Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT’94). Springer Lecture Notes in Computer Science 824, pages 25–36, 1994.

    Google Scholar 

  2. N. Alon and Y. Azar. On-line Steiner trees in the Euclidean plane. Discrete and Computational Geometry, 10:113–121, 1993. A preliminary version was published in Proceedings of the 8th Annual Symposium on Computational Geometry (SoCG’92), pages 337–343, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Awerbuch, Y. Bartal, and A. Fiat. Competitive distributed file allocation. In Proceedings of the 25th ACM Symposium on the Theory of Computation (STOC’93), pages 164–173, 1993.

    Google Scholar 

  4. Y. Bartal. Probabilistic approximation of metric spaces andits algorithmic applications. In Proceedings of the 37th Symposium on Foundations of Computer Science (FOCS’96), pages 183–193, 1996.

    Google Scholar 

  5. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th ACM Symposium on the Theory of Computation (STOC’98), pages 161–168, 1998.

    Google Scholar 

  6. Y. Bartal, A. Blum, C. Burch, and A. Tomkins. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the 29th ACM Symposium on the Theory of Computation (STOC’97), pages 711–719, 1997.

    Google Scholar 

  7. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proceedings of the 24th ACM Symposium on the Theory of Computation (STOC’92), pages 39–50, 1992.

    Google Scholar 

  8. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2–14, 1994. A preliminary version was published in Proceedings of the 22nd ACM Symposium on Theory of Computation (STOC’90), pages 379–386, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. L. Black and D.D. Sleator. Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Carnegie Mellon University, 1989.

    Google Scholar 

  10. A. Blum and C. Burch. On-line learning andth e metrical task system problem. In Proceedings of the 10th Conference on Computational Learning Theory, pages 45–53, 1997.

    Google Scholar 

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

    MATH  Google Scholar 

  12. A. Fiat und G. Woeginger, editors. Online Algorithms — The State of the Art. Springer Lecture Notes in Computer Science 1442. Springer-Verlag, Heidelberg, 1998.

    Google Scholar 

  13. W. Glazek. On-line algorithms for page replication in rings. Presented at the ALCOM Workshop on On-line Algorithms, Aug 31-Sep 5, Udine, Italy, 1998.

    Google Scholar 

  14. W. Glazek. Lower andupp er bounds for the problem of page replication in ring networks. In Proceedings of the 24th International Symposium on the Mathematical Foundations of Computer Science (MFCS’99). Springer Lecture Notes in Computer Science 1672, pages 273–283, 1999.

    Google Scholar 

  15. M. Imase and B.M. Waxman. Dynamic Steiner tree problem. SIAM Journal on Discrete Mathematics, 4(3):369–384, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Irani. Page placement with multi-size pages andap plications to web caching. In Proceedings of the 29th ACM Symposium on the Theory of Computation (STOC’97), pages 701–710, 1997.

    Google Scholar 

  17. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. M. Karp. A 2k-competitive algorithm for the circle. Unpublished manuscript, 1989.

    Google Scholar 

  19. H. Koga. Randomized on-line algorithms for the page replication problem. In Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC’93). Springer Lecture Notes in Computer Science 762, pages 436–445, 1993.

    Google Scholar 

  20. C. Lund, N. Reingold, J. Westbrook, and D. Yan. On-line distributed data management. In Proceedings of the 2nd European Symposium on Algorithms (ESA’94). Springer Lecture Notes in Computer Science 855, pages 202–214, 1994.

    Google Scholar 

  21. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. Springer-Verlag, Heidelberg, 1984.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  24. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior.Princeton University Press, Princeton, NJ, 1. edition, 1944.

    MATH  Google Scholar 

  25. A. C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Symposium on Foundations of Computer Science (FOCS’77), pages 222–227, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada

    Rudolf Fleischer

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

    Steve Seiden

Authors
  1. Rudolf Fleischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steve Seiden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Christian-Albrechts-Universität zu Kiel Institut für Informatik und praktische Mathematik Olshausenstr, 40, 24098, Kiel, Germany

    Klaus Jansen

  2. Computer Science Department, University of Maryland, A.V. Williams Bldg College Park, MD 20742, USA

    Samir Khuller

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischer, R., Seiden, S. (2000). New Results for Online Page Replication. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-44436-X_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67996-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation