In this paper we introduce a two-phase dynamic loadbalancing technique for P2P computing systems. The first phase consists of mapping a P2P network onto a hierarchical topology based on 1-D space tessellations. This hierarchy is called TreeP (Tree based P2P architecture). The second phase consists of balancing the load among the peers using the PSLB (Positional Scan Load-Balancing) technique, which is well suited for regular topologies. We study this technique and optimize its implementation on the TreeP topology. This technique is simple, efficient, scalable, and does not introduce a considerable overhead as shown in the experimental results and theoretical study.
Citation:
Muhammad Waseem Akhtar, M-Tahar Kechadi, "On the Efficiency of Dynamic Load Balancing on P2P Irregular Network Topologies," ispdc, pp.271-280, Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06), 2006