By Topic

Improvement of Chord Routing Algorithm

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

1 Author(s)
Wang Biqing ; Dept. of Math. & Comput. Sci., Tongling Univ., Tongling, China

The key in P2P network is to locate resources effectively.Chord is a kind of structured P2P network, but the routing table in Chord suffers serious information redundancy and it is not very efficient.Therefore, an improved chord routing algorithm is proposed.On the premise of not increasing the length of routing table, repetitious entries are deleted and anticlockwise routing in the same amount are added.Simulation experiments show that the algorithm eliminates information redundancy, reduces the average lookup path length and gets higher efficiency so as to coordinates lookup efficiency and routing table length well.

Published in:

Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on  (Volume:1 )

Date of Conference:

22-24 May 2009