David Karger
Eric Lehman
- 1.Anawat Chankhunthod, Peter Danzig, Chuck Neerdaels, Michael Schwartz and Kurt Worrell. A Hierarchical Intemet Object Cache. In USENIX Proceedings, 1996. Google Scholar
Digital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 6.Radhika Malpani, Jacob Lorch and David Berger. Making World Wide Web Caching Servers Cooperate. In Proceedings of World Wide Web Conference, 1996.Google Scholar
- 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 ScholarDigital Library
- 8.D. Peleg and A. Wool. The availability of quorum systems. Infi~rmation and Computation 123(2):210-233, 1995. Google ScholarDigital Library
- 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 ScholarDigital Library
- 10.M.O. Rabin. Efficient dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of the ACM 36:335-348, 1989. Google ScholarDigital Library
- 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 ScholarDigital Library
Index Terms
- Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
Recommendations
Load Balancing Using Consistent Hashing: A Real Challenge for Large Scale Distributed Web Crawlers
WAINA '09: Proceedings of the 2009 International Conference on Advanced Information Networking and Applications WorkshopsLarge scale search engines nowadays use distributed Web crawlers to collect Web pages because it is impractical for a single machine to download the entire Web. Load balancing of such crawlers is an important task because of limitations in memory/...
The Height and Size of Random Hash Trees and Random Pebbled Hash Trees
The random hash tree and the N-tree were introduced by Ehrlich in 1981. In the random hash tree, n data points are hashed to values X1, . . . , Xn, independently and identically distributed random variables taking values that are uniformly distributed ...
Comments