Chapter

Peer-to-Peer Systems II

Volume 2735 of the series Lecture Notes in Computer Science pp 68-79

Load Balancing in Structured P2P Systems

  • Ananth RaoAffiliated withComputer Science Division, University of California at Berkeley
  • , Karthik LakshminarayananAffiliated withComputer Science Division, University of California at Berkeley
  • , Sonesh SuranaAffiliated withComputer Science Division, University of California at Berkeley
  • , Richard KarpAffiliated withComputer Science Division, University of California at Berkeley
  • , Ion StoicaAffiliated withComputer Science Division, University of California at Berkeley

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Most P2P systems that provide a DHT abstraction distribute objects among “peer nodes” by choosing random identifiers for the objects. This could result in an O(log N) imbalance. Besides, P2P systems can be highly heterogeneous, i.e. they may consist of peers that range from old desktops behind modem lines to powerful servers connected to the Internet through high-bandwidth lines. In this paper, we address the problem of load balancing in such P2P systems. We explore the space of designing load-balancing algorithms that uses the notion of “virtual servers”. We present three schemes that differ primarily in the amount of information used to decide how to re-arrange load. Our simulation results show that even the simplest scheme is able to balance the load within 80% of the optimal value, while the most complex scheme is able to balance the load within 95% of the optimal value.