10.1145/258533.258660acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free Access

Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

Authors Info & Claims
Online:04 May 1997Publication History
First page image

References

  1. 1.Anawat Chankhunthod, Peter Danzig, Chuck Neerdaels, Michael Schwartz and Kurt Worrell. A Hierarchical Intemet Object Cache. In USENIX Proceedings, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Robert Devine. Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm. In Proceedings of 4th International Conference on Foundations of Data Organizations and Algorithms, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.M. J. Feeley, W. E. Morgan, F. P. Pighin, A. R. Karlin, H. M. Levy and C. A. Thekkath. Implementing Global Memory Management in a Workstation Cluster. In Proceedings of the 15th ACM Symposium on Operating Systems Principles, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Sally Floyd, Van Jacobson, Steen McCanne, Ching-Gung Liu and Lixia Zhang. A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing, SIGCOMM' 95 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Witold Litwin, Marie-Anne Neimat and Donovan A. Schneider. L H*-A Scalable, Distributed Data Structure. ACM Transactions on Database Systems, Dec. 1996 Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Radhika Malpani, Jacob Lorch and David Berger. Making World Wide Web Caching Servers Cooperate. In Proceedings of World Wide Web Conference, 1996.Google ScholarGoogle Scholar
  7. 7.M. Naor and A. Wool. The load, capacity, and availability of quorum systems. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 214-225, November 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.D. Peleg and A. Wool. The availability of quorum systems. Infi~rmation and Computation 123(2):210-233, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.Greg Plaxton and Rajmohan Rajaraman. Fast Fault-Tolerant Concurrent Access to Shared Objects. In Proceedings of 37th IEEE Symposium on Foundations of Computer Science, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.M.O. Rabin. Efficient dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of the ACM 36:335-348, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.Jeanette Schmidt, Alan Siegel and Aravind Srinivasan. Chemoff- Hoeffding Bounds for Applications with Limited Independence. In Proc. 4th ACS-SIAM Symposium on Discrete Algorithm& 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in
                • Published in

                  ACM Conferences cover image
                  STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
                  May 1997
                  752 pages
                  ISBN:0897918886
                  DOI:10.1145/258533

                  Copyright © 1997 ACM

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Online: 4 May 1997
                  • Published: 4 May 1997

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Qualifiers

                  • Article

                  Acceptance Rates

                  STOC '97 Paper Acceptance Rate 75 of 211 submissions, 36%
                  Overall Acceptance Rate 1,369 of 4,226 submissions, 32%

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!