Research on the Chord Algorithm Based on Physical Location and Node Ability

An important problem that confronts P2P network is to efficiently search the node that stores a particular data. Chord is a distributed lookup protocol that addresses the problem. However, the chord protocol has not yet efficiently resolved the problem. In this paper an improved Chord algorithm is presented, which considers the node´s actual ability, the physical location relationship, the routing pointer redundancy, the node load balancing and so on. Results from theoretical analysis, simulations, and experiments show that improved Chord algorithm is superior to the old Chord algorithm at the key performance indexes such as latency stretch, jump number and average inquires delay.