Please use this identifier to cite or link to this item:
|Title:||Distributed discovery of network resources in p2p systems||Authors:||Yap, Teck Min.||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems||Issue Date:||2010||Abstract:||Peer-to-Peer (P2P) network system which is a distributed system are getting famous in recent years and hence those P2P applications are broadly used in file sharing and transferring such as Gnutella, BitTorrent, uTorrent, BitComet and FlashTrack. P2P systems are divided into two categories i.e. unstructured and structured systems. Structured systems are getting preferable by users because they have a reliable and efficient feature which is Distributed Hash Table (DHT) to perform the hashing and key allocation. One of these structured systems‟ protocol is Chord protocol; a scalable P2P lookup protocol. Open Chord Application Programming Interface (API) which is an open source has been developed by University Bamberg is a very good example to implement the Chord protocol. Hence, a Java application is developed by using this Open Chord API which able to work in P2P network systems. To develop the application, designs of the application such as system designs, use cases designs, Graphical User Interface (GUI) designs and the workflow of the implementation are required. Then, the application developed is named as Chord Application. The Chord Application has two GUI windows; one is for creating node and another one is to implement the other four functions i.e. inserting data for files transferring, retrieve files, remove data for files transferring and shutdown node. It has implemented the Chord protocol‟s features and successfully made use the Open Chord API. The Chord Application is tested and simulated; it can be used to simulate or test a Chord network within one JVM in one running application. However, there are some improvements on this Chord Application especially is to simulate multiple running applications within one JVM to simulate a Chord network. They are recommended as future works of this FYP.||URI:||http://hdl.handle.net/10356/40535||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Student Reports (FYP/IA/PA/PI)|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.