Research and improvement of Chord routing algorithm
Biqing Wang
Abstract
Biqing Wang
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 route table length well.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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 route table length well.
Key concepts: Chord (peer-to-peer), Routing table, Computer science, Static routing, Destination-Sequenced Distance Vector routing, Equal-cost multi-path routing, Redundancy (engineering), Multipath routing