Skip to Main Content
DHT based routing protocols are very exciting innovative aspects in the area of P2P overlay networks; this kind of networks are appropriate and accepted especially in file sharing like transactions. The reason of the Distributed Hash Table is giving the way to search the resources (mostly files) inside the P2P network. A DHT protocol typically provides a single function to the P2P application: given a key, find the node (s) responsible for that key. All other functions (such as actually retrieving the resource or storing the resource on the node responsible for it) are provided by higher layers of the P2P application. In this paper the main concentration is moving towards to find the security vulnerabilities and determine them on presented routing protocols of such networks. The Chord protocol is preferred as the routing protocol for the variety of motives; those motives are covered in this paper.