A comparative study of peer to peer dynamic load balancing on embedded topologies

  • Authors:
  • Muhammad Waseem Akhtar;M-Tahar Kechadi

  • Affiliations:
  • School of Computer Science and Informatics, University College Dublin, Belfield, Dublin, Ireland;School of Computer Science and Informatics, University College Dublin, Belfield, Dublin, Ireland

  • Venue:
  • PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this study we evaluate and compare the performance of our load balancing technique on irregular P2P systems embedded in two regular topologies: 1) Hypercube and 2) TreeP. Hypercube is one of the most studied interconnection topologies and exhibits powerful interconnection features, while TreeP is Tree-based P2P network architecture and is based on a tessellation of a 1-D space. The load balancing technique employed is a two step strategy. In the first phase, it maps any irregular network topology to a regular one. In the second phase the load is balanced among the nodes using PSLB algorithm. In this paper we study and compare the performance of this two-step strategy on hypercube and TreeP topologies. This strategy is proven to be efficient and does not introduce a considerable overhead as shown in the experimental results.