Abstract
In interest-based structured P2P networks, the load unbalance problem restricts the performance of the network. To solve this problem, A Topology-based Load-Balancing Algorithm called T-LB is presented. It adopts the concept of virtual server, defines balancing domain as nodes with same interest, determine the Q value of each node according to the characteristics of the network topology, and then dynamically distribute network load based on the Q value of nodes. Simulation results show that T-LB improves the proportion of non-overloaded nodes to from 65% to 86%, reduces the average information query delay, and improves the performance of the network.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. Dalvi, Mrs Yogita A., R. Shankar, and Mr Atesh Kumar: American Journal of Computer Science & Engineering Survey, Vol. 1 (2013) No. 1, pp.7-13.
2. MI Wei, et al: Journal of Beijing University of Posts and Telecommunications, Vol. 33 (2010) No. 6, pp.116-120. (In Chinese).
3. Stoica, Ion, et al: Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM Computer Communication Review, Vol. 31 (2001) No. 4, pp.149-160.
4. Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler: Distributed Computing (Springer Berlin Heidelberg, 2013), pp.537-549.
5. WEI Xiang-lin, et al: Journal of Beijing University of Posts and Telecommunications. Vol. 35 (2012) No. 3, pp.87-90. (In Chinese).