基于Chord的动态多路由算法.pdf

36 4 2010 2 Vol.36 No.4 Computer Engineering February 2010 ·· 2010 A TP393.04 Chord ( 410076) Chord Chord Chord Dynamic Multi-routing Algorithm Based on Chord CHEN Yuan-tao, WU Hai-zhen (College of Computer and Communication Engineering, Changsha University of Science Technology, Changsha 410076) AbstractAccording to the clustering property of routing distance each hop in Chord routing protocol, this paper proposes a dynamic multi-routing algorithm based on Chord without modifying each pointer table of each peer. Result proves that this algorithm can make load more balancing caused by node forwarding message, and raises the message route’s success ratio when the route source node and the route goal node have determined, and Chord is at the steady state in the situation. Key wordspointer table; hop; dynamic multi-routing; routing protocol Chord h ! U W Chord DHT U W [1] a−1 Chord x , x , , x x (i [1, h]i Z)2 1 2 h i Chord x x x 1 2 h ( ) x , x , , x h ! 1 2 h [2] Chord h ! U W Chord 1