Unstructured P2P Network Load Balance Strategy Based on Multilevel Partitioning of Hypergraph

• Published in: Open Physics
• Main Authors: Feng Lv, Chunlin Gao, Kaiyang Ma
• Format: Article
• Language: English
• Published: De Gruyter 2017-05-01
• Subjects: hypergraph; multi-level partitioning; p2p; load balance; k-l algorithm; 42.30.va
• Online Access: https://doi.org/10.1515/phys-2017-0024

With rapid development of computer performance and distributed technology, P2P-based resource sharing mode plays important role in Internet. P2P network users continued to increase so the high dynamic characteristics of the system determine that it is difficult to obtain the load of other nodes. Therefore, a dynamic load balance strategy based on hypergraph is proposed in this article. The scheme develops from the idea of hypergraph theory in multilevel partitioning. It adopts optimized multilevel partitioning algorithms to partition P2P network into several small areas, and assigns each area a supernode for the management and load transferring of the nodes in this area. In the case of global scheduling is difficult to be achieved, the priority of a number of small range of load balancing can be ensured first. By the node load balance in each small area the whole network can achieve relative load balance. The experiments indicate that the load distribution of network nodes in our scheme is obviously compacter. It effectively solves the unbalanced problems in P2P network, which also improve the scalability and bandwidth utilization of system.