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

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 Abstract

Venue:	In Proc. 29th ACM Symposium on Theory of Computing (STOC
Citations:	438 - 10 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web	INFERENCE
AUTHOR NAME	David Karger	SVM HeaderParse 0.2
AUTHOR NAME	Eric Lehman	SVM HeaderParse 0.2
AUTHOR NAME	Tom Leighton	SVM HeaderParse 0.2
AUTHOR NAME	Matthew Levine	SVM HeaderParse 0.2
AUTHOR NAME	Daniel Lewin	SVM HeaderParse 0.2
AUTHOR NAME	Rina Panigrahy Abstract	SVM HeaderParse 0.2
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. 1	SVM HeaderParse 0.2
YEAR	1997	INFERENCE
VENUE	In Proc. 29th ACM Symposium on Theory of Computing (STOC	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	654--663	INFERENCE
CITATIONS	11 found	ParsCit 1.0