Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web

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

(May 1997), pp. 654-663.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

sebbo, pool007, fmc, sediga, mithuna, angus

Find related articles with these CiteULike tags

algorithms, and, architecture, article, caching, cachingweb, cs591, decentralised, design, dht, distributed, fault-tolerance, great, no-tag, on, peer-to-peer, performance, scalability, software-engineering, theory

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

@inproceedings{citeulike:1387273, 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...}, author = {Karger, David and Lehman, Eric and Leighton, Tom and Levine, Mathhew and Lewin, Daniel and Panigrahy, Rina }, booktitle = {ACM Symposium on Theory of Computing}, citeulike-article-id = {1387273}, month = {May}, pages = {654--663}, posted-at = {2008-04-29 13:35:08}, priority = {1}, title = {Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web}, url = {http://citeseer.ist.psu.edu/karger97consistent.html}, year = {1997} }

RIS record

TY - CONF ID - citeulike:1387273 L3 - citeulike-article-id:1387273 TI - Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web T2 - ACM Symposium on Theory of Computing SP - 654 EP - 663 N2 - 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... AU - Karger, David AU - Lehman, Eric AU - Leighton, Tom AU - Levine, Mathhew AU - Lewin, Daniel AU - Panigrahy, Rina PY - 1997/May// UR - http://citeseer.ist.psu.edu/karger97consistent.html ER -

RIS BibTeX