DocumentCode
3059083
Title
Improvement of Chord Routing Algorithm
Author
Wang Biqing
Author_Institution
Dept. of Math. & Comput. Sci., Tongling Univ., Tongling, China
Volume
1
fYear
2009
fDate
22-24 May 2009
Firstpage
523
Lastpage
525
Abstract
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.
Keywords
peer-to-peer computing; telecommunication network routing; anticlockwise routing; average lookup path length; chord routing algorithm; information redundancy; peer-to-peer network; routing table; structured P2P network; Clocks; Computer networks; Computer science; Computer security; Electronic commerce; Fingers; Grid computing; Information security; Mathematics; Routing; Chord; P2P; algorithm; routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on
Conference_Location
Nanchang
Print_ISBN
978-0-7695-3643-9
Type
conf
DOI
10.1109/ISECS.2009.217
Filename
5209884
Link To Document