Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems

By David R Karger, M. Ruhl. ACM Symposium on Parallelism in Algorithms and Architectures, 2004

528 citations recorded by the source corpus.

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/2f4e7a552766ebbda6595fde6e6472a63ebc1386

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. John Risson
2. Tim Moors
3. Maarten van Steen
4. Guillaume Pierre
5. Mukesh Agrawal
6. Ashwin R. Bharambe
7. Guido Urdaneta
8. Srinivasan Seshan

Citations in the corpus

• Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Storage Consistency & Replication [101-112] Eventual consistency Trade-offs Distribution [39, 42, 90, 92, 113-131] Epidemics, Bloom Filters Fault Tolerance [40, 105, 132-139] Erasure Coding Byzantine Agreement Locality [24, 43, 47, 140-160] Load Balancing [37, 86, 100, 107, 151, 161-171]”
• Wikipedia workload analysis for decentralized hosting (2009, background): “Note that load balancing within a DHT is considered a difficult problem for which a number of specific solutions exist [19].”
• Mercury: supporting scalable multi-attribute range queries (2004, methodology): “However, [13] and [8] do not handle skewed node range distributions.”