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

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:519 - 11 self

Document Versions

Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web –David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy Abstract — 1997 — In Proc. 29th ACM Symposium on Theory of Computing (STOC
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web –David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy — 1997 — In STOC
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web –David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, Rina Panigrahy — 1997 — In ACM Symposium on Theory of Computing
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web –David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy — 1997 — In Proc. of STOC, El Paso, TX