Please use this identifier to cite or link to this item: https://doi.org/10.1109/TPDS.2007.70732
DC FieldValue
dc.titleDCMP: A distributed cycle minimization protocol for peer-to-peer networks
dc.contributor.authorZhu, Z.
dc.contributor.authorKalnis, P.
dc.contributor.authorBakiras, S.
dc.date.accessioned2013-07-04T07:42:46Z
dc.date.available2013-07-04T07:42:46Z
dc.date.issued2008
dc.identifier.citationZhu, Z., Kalnis, P., Bakiras, S. (2008). DCMP: A distributed cycle minimization protocol for peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 19 (3) : 363-377. ScholarBank@NUS Repository. https://doi.org/10.1109/TPDS.2007.70732
dc.identifier.issn10459219
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39490
dc.description.abstractBroadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due to their simplicity, ease of deployment and versatility. The unstructured network topology, however, contains many cyclic paths which introduce numerous duplicate messages in the system. While such messages can be identified and ignored, they still consume a large proportion of the bandwidth and other resources, causing bottlenecks in the entire network. 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. © 2008 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TPDS.2007.70732
dc.sourceScopus
dc.subjectDistributed systems
dc.subjectNetwork protocols
dc.subjectPeer-topeer
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/TPDS.2007.70732
dc.description.sourcetitleIEEE Transactions on Parallel and Distributed Systems
dc.description.volume19
dc.description.issue3
dc.description.page363-377
dc.description.codenITDSE
dc.identifier.isiut000252553000007
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

15
checked on Nov 13, 2019

WEB OF SCIENCETM
Citations

9
checked on Nov 13, 2019

Page view(s)

100
checked on Oct 28, 2019

Google ScholarTM

Check

Altmetric


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