Dynamic Load Balancing of Content Requests in Peer to Peer Systems

M.W. Akhtar and M.-T. Kechadi (Ireland)


Peer to Peer Systems, Parallel Algorithms and Architec tures, Dynamic Load Balancing, Graph Embedding, Hy percube.


This paper presents and evaluates a new load balancing technique for content requests in a peer to peer system for the peer nodes holding replicas of the content. The tech nique is dynamic, non-preemptive, adaptive, and fully dis tributed. The technique is a two step strategy; firstly, it maps the given peer to peer network having an irregular topology into a hypercube and then balances the request’s load among the nodes using our PSLB algorithm. The tech nique collects the information on the system in a distributed fashion. On the basis of this information, each peer lo cally calculates the amount of requests that should be kept and/or received and the amount of requests that should be sent. This technique is simple, efficient, and does not intro duce a considerable overhead as shown in the experimental results.

Important Links:

Go Back