Load balancing in dynamic structured peer-to-peer systems

Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard Karp, Ion Stoica

Research output: Contribution to journalArticlepeer-review

Abstract

Most P2P systems that provide a DHT abstraction distribute objects randomly among "peer nodes" in a way that results in some nodes having Θ(log N) times as many objects as the average node. Further imbalance may result due to nonuniform distribution of objects in the identifier space and a high degree of heterogeneity in object loads and node capacities. Additionally, a node's load may vary greatly over time since the system can experience continuous insertions and deletions of objects, skewed object arrival patterns, and continuous arrival and departure of nodes. In this paper, we propose an algorithm for load balancing in such heterogeneous, dynamic P2P systems. Our simulation results show that in the face of rapid arrivals and departures of objects of widely varying load, our algorithm improves load balance by more than an order of magnitude for system utilizations as high as 80% while incurring an overhead of only about 6%. We also show that our distributed algorithm performs only negligibly worse than a similar centralized algorithm, and that node heterogeneity helps, not hurts, the scalability of our algorithm. Although many of these results are dependent on the workload, we believe the efficiency and performance improvement demonstrated over the case of no load balancing shows that our technique holds promise for deployed systems.

Original languageEnglish (US)
Pages (from-to)217-240
Number of pages24
JournalPerformance Evaluation
Volume63
Issue number3
DOIs
StatePublished - Mar 2006
Externally publishedYes

Keywords

  • Distributed hash table
  • Dynamic load balancing
  • Structured peer-to-peer

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Load balancing in dynamic structured peer-to-peer systems'. Together they form a unique fingerprint.

Cite this