Routing Protocols of Distributed Hash Table Based Peer to Peer Networks

Distributed hash tables (DHTs) is an extremely attractive study theme during the part of P2P networks; such networks be fetching especially admired in functions similar to file sharing. The idea of the Distributed Hash Table is given that the technique to explore the resources (especially files) within a P2P network. A DHT protocol usually affords a solitary task to the P2P function: afford a key and find out the node (or may be nodes) which is responsible for such key [1][3]. Each and every one function (such as really recover the resource or storing the resource on the node afford for it) is offered by superior levels of the P2P function. In such article our objective is to discover the security measures and determine them on accessible routing procedures of such networks. The Chord [4] (a DHT protocol) is selected as the objective approach for a variety of reasons it resolve be enclosed in this paper.