Chord: A distributed Overlay Network Mechanism for Peer-to-Peer Systems

This research is based on “Chord: A distributed overlay network mechanism for Peer-to-Peer Systems”. The chord algorithm is implementation of logarithmic complexity for structured peer-to-peer network. An essential issue that goes up against peer-to-peer applications is the efficient area of the node that stores a suitable data item. For this issue, Chord provides support to fix it. Chord algorithm is best for designing Peer-to-Peer network and application. Chord is based on consistent hashing. It supports one operation which is Given a key, determines which node is responsible for storing the key value. We analyze the algorithm for both peer join and peer failure. When we analyze the algorithm it gives some insight into the behaviour of the system. This paper is mainly focused on how Chord is working for peer-to-peer networks