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

DMCA

Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David Karger , Eric Lehman , Tom Leighton , Matthew Levine , Daniel Lewin , Rina Panigrahy

Venue:	IN PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC
Citations:	688 - 10 self

BibTeX

@INPROCEEDINGS{Karger97consistenthashing,
    author = {David Karger and Eric Lehman and Tom Leighton and Matthew 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 PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC},
    year = {1997},
    pages = {654--663},
    publisher = {}
}

OpenURL

Abstract

We describe a family of caching protocols for distrib-uted 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 have a current or even consistent view of the network. We believe that consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems.

Keyphrases

caching protocol hot spot consistent hashing random tree world wide web consistent hash function large network roughly speaking tcp ip good consistent hash function network grows consistent view distrib-uted network entire network network protocol quorum system little overhead complete information distributed name server protocol work function change local control special kind current state efficient use

DMCA