loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Grid and Cooperative Computing (GCC 2007)
On the Convergence of Chord Network
Urumchi, Xinjiang, China
August 16-August 18
ISBN: 0-7695-2871-6
NIE Xiao-wen, UESTC, ChengDu
LU Xian-liang, UESTC, ChengDu
DUAN Han-cong, UESTC, ChengDu
LI Lin, UESTC, ChengDu
PU Xun, UESTC, ChengDu
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.
Citation:
NIE Xiao-wen, LU Xian-liang, DUAN Han-cong, LI Lin, PU Xun, "On the Convergence of Chord Network," gcc, pp.104-108, Sixth International Conference on Grid and Cooperative Computing (GCC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.