Simple efficient load-balancing algorithms for peer-to-peer systems

Theory of Computing Systems

Volumn 39, Issue 6, 2006, Pages 787-804

  Karger, David R ^a   Ruhl, Matthias ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENT HASHING; DATA MIGRATION COST; DISTRIBUTED DATA STRUCTURES; DISTRIBUTED HASH TABLES; LOAD-BALANCING ALGORITHM; PEER TO PEER (P2P) NETWORK; PEER-TO-PEER SYSTEM; PERFORMANCE GUARANTEES;

COMMUNICATION SYSTEMS; NETWORK MANAGEMENT; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

PEER TO PEER NETWORKS;

EID: 33845347872     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1246-6     Document Type: Conference Paper

References (22)

1. [AHKV] Micah Adler, Eran Halperin, Richard M. Karp, and Vijay V. Vazirani. A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks. In Proceedings STOC, pages 575-584, June 2003.
2. [AKU] Aris Anagnostopoulos, Adam Kirsch, and Eli Upfal. Stability and Efficiency of a Random Local Load Balancing Protocol. In Proceedings FOCS, pages 472-481, October 2003.
3. [AS] James Aspnes and Gauri Shah. Skip Graphs. In Proceedings SODA, pages 384-393, January 2003.
4. [GB] Prasanna Ganesan and Mayank Bawa. Distributed Balanced Tables: Not Making a Hash of It All. Technical Report 2003-71, Stanford University, Database Group, November 2003.
5. +] Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, Boon T. Loo, Scott Shenker, and Ion Stoica. Complex Queries in DHT-Based Peer-to-Peer Networks. In Proceedings IPTPS, pages 242-250, March 2002.
6. +] Ryan Huebsch, Joseph M. Hellerstein, Nick Lanham, Boon Thau Loo, Scott Shenker, and Ion Stoica. Querying the Internet with PIER. In Proceedings VLDB, pages 321-332, September 2003.
7. +] Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, and Alec Wolman. SkipNet: A Scalable Overlay Network with Practical Locality Properties. In Proceedings USITS, pages 113-126, March 2003.
8. +] John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski, Patrick Eaton, Dennis Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon, Westley Weimer, Chris Wells, and Ben Zhao. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings ASPLOS, pages 190-201, November 2000.
9. [KK] Frans Kaashoek and David R. Karger. Koorde: A Simple Degree-Optimal Hash Table. In Proceedings IPTPS, pages 98-107, February 2003.
10. +] David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, and Rina Panigrahy. Consistent Hashing and Random Trees: Tools for Relieving Hot Spots on the World Wide Web. In Proceedings STOC, pages 654-663, May 1997.
11. [L] Daniel M. Lewin. Consistent Hashing and Random Trees: Algorithms for Caching in Distributed Networks. Master's thesis, Massachusetts Institute of Technology, May 1998.
12. [LNBK] David Liben-Nowell, Hari Balakrishnan, and David Karger. Analysis of the Evolution of Peer-to-Peer Systems. In Proceedings PODC, pages 233-242, July 2002.
13. [M] Gurmeet Singh Manku. Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables. In Proceedings PODC, pages 197-205, July 2004.
14. [MM] Petar Maymounkov and David Mazièes. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In Proceedings IPTPS, pages 53-65, March 2002.
15. [MNR] Dalia Malkhi, Moni Naor, and David Ratajczak. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proceedings PODC, pages 183-192, July 2002.
16. [NW] Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. In Proceedings SPAA, pages 50-59, June 2003.
17. [RD] Antony Rowstron and Peter Druschel. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer systems. In Proceedings IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pages 329-350, November 2001.
18. +] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A Scalable Content-Addressable Network. In Proceedings ACM SIGCOMM, pages 161-172, August 2001.
19. +] Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard Karp, and Ion Stoica. Load Balancing in Structured P2P Systems. In Proceedings IPTPS, pages 68-79, February 2003.
20. [SA] Raimund G. Seidel and Cecilia R. Aragon. Randomized Search Trees. Algorithmica, 16(4/5):464-497, October/November 1996.
21. +] Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proceedings ACM SIGCOMM, pages 149-160, August 2001.
22. [SSS] Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-Hoeffding Bounds for Applications with Limited Independence. In Proceedings SODA, pages 331-340, January 1993.