An Improvement to the Chord-Based P2P Routing Algorithm

Chord has been widely used as a routing protocol in structured peer-to-peer overlay networks. A fundamental problem of peer-to-peer applications is to efficiently locate the node that stores a particular data item. In fact, performance of structured peer-to-peer overlay networks depends on the routing protocols. The original Chord routing protocol based on DHT uses Finger Table to route. However, in the original model, there is redundancy information in the Finger Table. This paper analyzes the routing algorithm of Chord protocol and presents an improvement strategy of original Chord routing algorithm. Results from theoretical analysis and experiments show that the routing performance of structured Chord-based overlay networks is improved.