Chapter 7 Reference 18

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

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

29th Annual ACM Symposium on Theory of Computing 1997 people.csail.mit.edu

Open the original at people.csail.mit.edu

As cited in DDIA

David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew Levine, and Daniel Lewin. "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web." At 29th Annual ACM Symposium on Theory of Computing (STOC), May 1997. doi:10.1145/258533.258660

Link check

Status: Link checked and reachable (HTTP 200)
Format: application/pdf
Size: 0.2 MB
Last checked: 2026-08-29

Identifiers and archived copies

DOI: 10.1145/258533.258660