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:590 - 12 self

Active Bibliography

4 Relieving Hot Spots on the World Wide Web – David R. Karger, Arthur C. Smith, Rina Panigrahy, Rina Panigrahy - 1997
904 Wide-area cooperative storage with CFS – Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica - 2001
595 Practical Byzantine Fault Tolerance – Miguel Castro, Barbara Loskov
871 Wireless Ad Hoc Networks – Zygmunt J. Haas, Jing Deng, Ben Liang, Panagiotis Papadimitratos, S. Sajama - 2002
512 Overcast: Reliable Multicasting with an Overlay Network – John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, James W. O'Toole, Jr., M. Frans, Kaashoek James - 2000
2023 MapReduce: Simplified Data Processing on Large Clusters – Jeffrey Dean, et al. - 2004
539 Basic concepts and taxonomy of dependable and secure computing – Algirdas Avizienis, Jean-claude Laprie, Brian Randell, Carl Landwehr - 2004
489 A Survey of active network Research – David L. Tennenhouse, Jonathan M. Smith - 1997
426 Small Byzantine Quorum Systems – Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin - 2001