Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (1997)
Cached
Download Links
- [types.bu.edu]
- [www.cs.princeton.edu:80]
- [www.cs.brown.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [www-cse.ucsd.edu]
- CiteULike
- DBLP
Other Repositories/Bibliography
| Venue: | In ACM Symposium on Theory of Computing |
| Citations: | 438 - 10 self |
BibTeX
@INPROCEEDINGS{Karger97consistenthashing,
author = {David Karger and Eric Lehman and Tom Leighton and Mathhew Levine and Daniel Lewin and Rina Panigrahy},
title = {Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web},
booktitle = {In ACM Symposium on Theory of Computing},
year = {1997},
pages = {654--663}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of hashing that we call consistent hashing. Roughly speaking, a consistent hash function is one which changes minimally as the range of the function changes. Through the development of good consistent hash functions, we are able to develop caching protocols which do not require users to ...
