Routing Based Load Balancing for Unstructured P2P Networks

  • Authors:
  • Ming Xu;Jihong Guan

  • Affiliations:
  • -;-

  • Venue:
  • FGCN '07 Proceedings of the Future Generation Communication and Networking - Volume 02
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Load balancing is an important problem for the efficient operation of peer-to-peer(P2P) networks. A key issue for dynamic load balancing in self-organizing networks is to identify overloaded nodes and reassign their loads to oth- ers. Recently, most of researchers have concentrated on de- veloping strategies to the design of balanced structured P2P networks. However, none of these strategies is suitable for unstructured P2P networks. This paper proposes a novel routing based algorithm for load balancing in heteroge- neous, dynamic unstructured P2P networks. Our algorithm does not need the global information and hence is resilient to dynamic node arrivals, departures, and failures. Exper- imental results indicate that our algorithm outperforms ex- isting load balancing algorithms in terms of load transfer.