1st International ICST Conference on Networks for Grid Applications

Research Article

A Novel Load Balancing Mechanism for P2P Networking

Download539 downloads
  • @INPROCEEDINGS{10.4108/gridnets.2007.2254,
        author={Leonidas Lymberopoulos and Symeon Papavassiliou and Vasilis Maglaris},
        title={A Novel Load Balancing Mechanism for P2P Networking},
        proceedings={1st International ICST Conference on Networks for Grid Applications},
        publisher={ICST},
        proceedings_a={GRIDNETS},
        year={2007},
        month={10},
        keywords={P2P load balancing Distributed K-D tree P2P Grid Information Service},
        doi={10.4108/gridnets.2007.2254}
    }
    
  • Leonidas Lymberopoulos
    Symeon Papavassiliou
    Vasilis Maglaris
    Year: 2007
    A Novel Load Balancing Mechanism for P2P Networking
    GRIDNETS
    ICST
    DOI: 10.4108/gridnets.2007.2254
Leonidas Lymberopoulos1,*, Symeon Papavassiliou1,*, Vasilis Maglaris1,*
  • 1: National Technical University of Athens 9 Iroon Polytechneiou 15780, Athens,Greece
*Contact email: eonidas@netmode.ntua.gr, papavass@mail.ntua.gr, maglaris@netmode.ntua.gr

Abstract

Peer to Peer (P2P) networking is a potential disruptive technology that can be used for the development of scalable, fully decentralized distributed applications. However, to realize its potential, P2P technology should address the needs of a variety of applications, other than file-sharing requiring support for exactmatch queries on the file names. Our work complements and contributes to existing P2P overlays that support multipleattributes and range queries, using the distributed K-Dimensional (K-D) tree structure for organizing shared information among participating peers. This guarantees that the time needed for node join - leave operations and query times are logarithmic with respect to the number of peers. In such systems, an open issue is load balancing of resources among peers, as only load-balanced data structures can guarantee that the complexity for resolving multi-attribute and range queries remains logarithmic (thus scalable) with respect to the number of participating peers. In this paper, we report a novel load balancing algorithm for dynamically keeping the resource load among peers balanced. We prove that the load balancing algorithm is robust and scalable, achieving an O(log2N) complexity, where N is the number of peers. We illustrate how our algorithm can be used to build a scalable Grid Information Service supporting multi-attribute and range queries on available services within the shared Grid infrastructure