By Topic

On the Convergence of Chord Network

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

5 Author(s)
Nie Xiao-wen ; Sch. of Comput. Sci. & Technol., UESTC, Chengdu ; Lu Xian-liang ; Duan Han-cong ; Li Lin
more authors

Due to the churn, the P2P overlay network can not be static. The dynamic environment may degrade the services provided by distributed hash table (DHT), then the convergence of the overlay is very important. In this paper, we try to analyze the convergence of Chord network. We prove that the generic structures of Chord network is a pseudo-tree, which can be converged to a circle by algorithm stabilize. The ring in Chord has more meanings than a circle in graph theory, and the ring requires all nodes in the network permuted by their ids. An efficient strong_stabilize algorithm is proposed to make the network converge to a ring rapidly.

Published in:

Grid and Cooperative Computing, 2007. GCC 2007. Sixth International Conference on

Date of Conference:

16-18 Aug. 2007