Improvement of Chord Routing Algorithm

摘要

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.