By Topic

A load balancing-supported ID management method for Constant Degree DHTs

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)
Xiaohai Wang ; Dept. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China ; Yuxing Peng ; Dongsheng Li

ID management method is the foundation to implement and maintain DHT overlays, especially for Constant Degree DHTs based on de Bruijn and Kautz, because their topologies are not incrementally expandable and using bit-shifting route schema etc. However, corresponding researches on Constant Degree DHTs are scarce, and realized Constant Degree DHTs usually use pure centralized or distributed ID management methods simply, thus cannot guarantee overlay's balance with low cost both in theory and practice. Analyzing the universal tree structures of Constant Degree diagraph, we propose an ID management method based on the internal structure Routing Forest, which regularly aggregates local balancing information to guide new nodes' joining for overall balance. The experimental results validate, with low maintenance and routing message overhead, node IDs' length differ by at most 2 in system, thus the load balancing is efficiently ensured.

Published in:

Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on  (Volume:7 )

Date of Conference:

9-11 July 2010