By Topic

Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhitang Li ; Comput. Sch., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Chuiwei Lu ; Yejiang Zhang

Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism, which can automatically select light-load peers with low delay and high bandwidth for load transfer. The simulation experiments demonstrate the improved algorithm owns faster velocity of load-balancing and less cost on load-transfer compared to traditional Chord protocol. Furthermore, the improved algorithm can maintain high load-balancing degree even under the condition of heavy network load, and has no particular requirement to the property of peers.

Published in:

Information Technology and Computer Science, 2009. ITCS 2009. International Conference on  (Volume:1 )

Date of Conference:

25-26 July 2009