Load Balancing Algorithm for DHT Based Structured Peer to Peer System
Chahita Taank, Rajesh D. Bharati · 2013
Many solutions have been proposed to tackle the load balancing issue in DHT-based P2P systems. However, all these solutions either ignore the heterogeneity nature of the system, or reassign loads among nodes. This algorithm presents an efficient load balancing scheme by using the concept of virtual servers. They typically use DHT based indexing such as chords, peers participating are heterogeneous, and by migrating virtual servers, peers can balance their loads proportional to their capacities. Compare the existing and with earlier decentralized load balance algorithms designed for the heterogeneous, structured P2P networks, either explicitly construct networks to manipulate global information and organized in tree shape or implicitly demand the P2P to organize in a two level hierarchical fashion. Present algorithm does not rely on any tree networks and independent of the geometry, leading to design more appropriate for large scale, dynamic environment. Instead of using random selection, the present algorithm can be improved by using the combination of random and greedy approaches. Peers can compute their expected loads and reallocate their loads in parallel. At simulations, different previous algorithms are compared with different performance matrix.