Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/15771
Title: Towards efficient peer-to-peer networks: A distributed cycle minimization approach
Authors: ZHU ZHENZHOU
Keywords: Network Protocols, Distributed Systems, Peer-to-Peer
Issue Date: 15-Feb-2007
Source: ZHU ZHENZHOU (2007-02-15). Towards efficient peer-to-peer networks: A distributed cycle minimization approach. ScholarBank@NUS Repository.
Abstract: In this paper we describe DCMP, a dynamic, fully decentralized protocol which reduces significantly the duplicate messages by eliminating unnecessary cycles. As queries are transmitted through the peers, DCMP identifies the problematic paths and attempts to break the cycles, while maintaining the connectivity of the network. In order to preserve the fault resilience and load balancing properties of unstructured P2P systems, DCMP avoids creating a hierarchical organization. Instead, it applies cycle elimination symmetrically around some powerful peers to keep the average path length small. The overall structure is constructed fast with very low overhead. With the information collected during this process, distributed maintenance is performed efficiently even if peers quit the system without notification. The experimental results from our simulator and the prototype implementation on PlanetLab, confirm that DCMP improves significantly the scalability of unstructured P2P systems without sacrificing their desirable properties. Moreover, due to its simplicity, DCMP can be easily implemented in various existing P2P systems and is orthogonal to the search algorithms.
URI: http://scholarbank.nus.edu.sg/handle/10635/15771
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Thesis.pdf1.13 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

170
checked on Jan 14, 2018

Download(s)

209
checked on Jan 14, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.