Article

Free access

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

Authors:

Daniel LewinAuthors Info & Claims

STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Pages 654 - 663

https://doi.org/10.1145/258533.258660

Published: 04 May 1997 Publication History

PDF eReader

References

[1]

Anawat Chankhunthod, Peter Danzig, Chuck Neerdaels, Michael Schwartz and Kurt Worrell. A Hierarchical Intemet Object Cache. In USENIX Proceedings, 1996.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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

Digital Library

Google Scholar

[5]

Witold Litwin, Marie-Anne Neimat and Donovan A. Schneider. L H*-A Scalable, Distributed Data Structure. ACM Transactions on Database Systems, Dec. 1996

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[8]

D. Peleg and A. Wool. The availability of quorum systems. Infi~rmation and Computation 123(2):210-233, 1995.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[10]

M.O. Rabin. Efficient dispersal of Information for Security, Load Balancing, and Fault Tolerance. Journal of the ACM 36:335-348, 1989.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

Cited By

View all

Ren YRen YLi XHu YLi JLee PMa XWon Y(2024)ELECTProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650715(293-310)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650715
Zhao NLin MAlbahar HPaul AHuan ZAbraham SChen KTarasov VSkourtis DAnwar AButt A(2024)An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage SystemsACM Transactions on Storage10.1145/364381920:3(1-35)Online publication date: 30-Jan-2024
https://dl.acm.org/doi/10.1145/3643819
Hosseini MDarabi SJahangir AMovaghar A(2024)Yuz: Improving Performance of Cluster-Based Services by Near-L4 Session-Persistent Load BalancingIEEE Transactions on Network and Service Management10.1109/TNSM.2023.334196421:2(1929-1942)Online publication date: Apr-2024
https://doi.org/10.1109/TNSM.2023.3341964
Show More Cited By

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 Workshops

Large 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 X₁, . . . , X_n, independently and identically distributed random variables taking values that are uniformly distributed ...
Analysis of random trees

Comments

Information & Contributors

Information

Published In

STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

May 1997

752 pages

ISBN:0897918886

DOI:10.1145/258533

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 May 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC97

Sponsor:

SIGACT

STOC97: 29th Annual Symposium on Theory of Computing

May 4 - 6, 1997

Texas, El Paso, USA

Acceptance Rates

STOC '97 Paper Acceptance Rate 75 of 211 submissions, 36%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,339
Total Citations
View Citations
15,706
Total Downloads

Downloads (Last 12 months)1,937
Downloads (Last 6 weeks)162

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ren YRen YLi XHu YLi JLee PMa XWon Y(2024)ELECTProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650715(293-310)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650715
Zhao NLin MAlbahar HPaul AHuan ZAbraham SChen KTarasov VSkourtis DAnwar AButt A(2024)An End-to-end High-performance Deduplication Scheme for Docker Registries and Docker Container Storage SystemsACM Transactions on Storage10.1145/364381920:3(1-35)Online publication date: 30-Jan-2024
https://dl.acm.org/doi/10.1145/3643819
Hosseini MDarabi SJahangir AMovaghar A(2024)Yuz: Improving Performance of Cluster-Based Services by Near-L4 Session-Persistent Load BalancingIEEE Transactions on Network and Service Management10.1109/TNSM.2023.334196421:2(1929-1942)Online publication date: Apr-2024
https://doi.org/10.1109/TNSM.2023.3341964
Wu SShen ZLee PBai ZXu Y(2024)Elastic Reed-Solomon Codes for Efficient Redundancy Transitioning in Distributed Key-Value StoresIEEE/ACM Transactions on Networking10.1109/TNET.2023.330386532:1(670-685)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3303865
Ma XXu D(2024)TORR: A Lightweight Blockchain for Decentralized Federated LearningIEEE Internet of Things Journal10.1109/JIOT.2023.328807811:1(1028-1040)Online publication date: 1-Jan-2024
https://doi.org/10.1109/JIOT.2023.3288078
Kikuma KUeda K(2024)Proposal and Evaluation of Virtual Node Placement Algorithm in KVS (Key Value Store)2024 IEEE International Conference on Consumer Electronics (ICCE)10.1109/ICCE59016.2024.10444207(1-5)Online publication date: 6-Jan-2024
https://doi.org/10.1109/ICCE59016.2024.10444207
Aladiyan A(2024)Efficient Data Structures and Algorithms for Cloud Computing Platforms2024 4th International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE)10.1109/ICACITE60783.2024.10617203(1717-1721)Online publication date: 14-May-2024
https://doi.org/10.1109/ICACITE60783.2024.10617203
Josbert NWei MWang P(2024)Industrial IoT regulated by Software-Defined Networking platform for fast and dynamic fault tolerance applicationSimulation Modelling Practice and Theory10.1016/j.simpat.2024.102963135(102963)Online publication date: Sep-2024
https://doi.org/10.1016/j.simpat.2024.102963
Wei WZhu NWang JSong HHe J(2024)A scalable blockchain storage scheme for VANETCluster Computing10.1007/s10586-023-04238-w27:4(3957-3981)Online publication date: 2-Feb-2024
https://doi.org/10.1007/s10586-023-04238-w
Gessert FWingerath WRitter NGessert FWingerath WRitter N(2024)Die NoSQL-Toolbox: Die NoSQL-Landschaft im ÜberblickSchnelles und skalierbares Cloud-Datenmanagement10.1007/978-3-031-54388-3_8(189-205)Online publication date: 3-May-2024
https://doi.org/10.1007/978-3-031-54388-3_8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Load Balancing Using Consistent Hashing: A Real Challenge for Large Scale Distributed Web Crawlers

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

Analysis of random trees

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Load Balancing Using Consistent Hashing: A Real Challenge for Large Scale Distributed Web Crawlers

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

Analysis of random trees

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations