An efficient lookup algorithm for dynamic peer-to-peer Chord

In a structured peer-to-peer (p2p) network, key based routing algorithms are used for searching and locating resources in the network. For dynamic and scalable behavior these algorithms suffer from high overhead to maintain large state information of nodes and to keep them up-to-date. To deal with this problem, a Sub-ring Based Chord model and a lookup algorithm are proposed. The lookup process keeps only O (log k) routing information where k is the number of sub-rings. The simulation results obtained in this work show that the algorithm achieves lower communication cost under different churning conditions compared to Chord.