Please use this identifier to cite or link to this item:
|Title:||PEER-TO-PEER DISTRIBUTED HASH TABLE|
|Keywords:||ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING;ELECTRONICS AND COMPUTER ENGINEERING|
|Abstract:||The last few years has seen the rapid rise of applications such as Napster, ICQ, Freenet and Gnutella, applications that have been labeled as peer-to-peer systems. Peer-to-peer has consequently become a buzzword, seen as a new frontier for computer science that can change the way applications are developed and the way computers are used. A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. Chord protocol addresses this problem. In our thesis, we have made an attempt to modify the existing Chord protocol which increases the routing efficiency. It is also proposed to develop P2P Distributed Hash Table using modified Chord Protocol. This distributes the hash table over the overlay network and this efficiently determines the node that stores a data item in a distributed network. This is implemented in C on Linux platform. Trial runs were made on Pentium IV systems running Redhat Linux 9.0 connected throughthe Dept of E&CE lab facility.|
|Research Supervisor/ Guide:||Singh, Kuldip|
|Appears in Collections:||MASTERS' DISSERTATIONS (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.