The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2008 vol.19)
pp: 363-377
ABSTRACT
Broadcast-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.
INDEX TERMS
Network protocols, distributed systems, peer-topeer
CITATION
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras, "DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 3, pp. 363-377, March 2008, doi:10.1109/TPDS.2007.70732
REFERENCES
[1] S. Ratnasamy, P. Francis, M. Handley, R.M. Karp, and S. Shenker, “A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM '01, pp. 161-172, 2001.
[2] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, 2003.
[3] Gnutella, http:/www.gnutella.com/ and http://groups.yahoo. com/groupthe_gdf/, 2007.
[4] Kazaa, http:/www.kazaa.com/, 2007.
[5] M. Ripeanu, A. Iamnitchi, and I.T. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, vol. 6, no. 1, pp. 50-57, 2002.
[6] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. ACM Int'l Conf. Supercomputing (ICS '02), pp. 84-95, 2002.
[7] PlanetLab, http:/www.planet-lab.org/, 2007.
[8] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM '03, pp. 407-418, 2003.
[9] B. Yang and H. Garcia-Molina, “Designing a Super-Peer Network,” Proc. 19th Int'l Conf. Data Eng. (ICDE '03), pp. 49-60, 2003.
[10] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '05), pp. 5-14, 2002.
[11] S. Bakiras, P. Kalnis, T. Loukopoulos, and W.S. Ng, “A General Framework for Searching in Distributed Data Repositories,” Proc. 17th Int'l Parallel and Distributed Processing Symp. (IPDPS '03), pp.34-41, 2003.
[12] P. Kalnis, W.S. Ng, B.C. Ooi, D. Papadias, and K.-L. Tan, “An Adaptive P2P Network for Distributed Caching of OLAP Results,” Proc. ACM SIGMOD '02, pp. 25-36, 2002.
[13] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in P2P Systems,” Proc. IEEE INFOCOM '03, pp. 2166-2176, 2003.
[14] Limewire, http:/www.limewire.com/, 2007.
[15] Y. Liu, Z. Zhuang, L. Xiao, and L.M. Ni, “A Distributed Approach to Solving Overlay Mismatching Problem,” Proc. 24th Int'l Conf. Distributed Computing Systems (ICDCS '04), pp. 132-139, 2004.
[16] X. Liu, Y. Liu, L. Xiao, L.M. Ni, and X. Zhang, “Location Awareness in Unstructured Peer-to-Peer Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 2, pp. 163-174, 2005.
[17] F. Bustamante and Y. Qiao, “Friendships That Last: Peer Lifespan and Its Role in P2P Protocols,” Proc. Ninth Int'l Workshop Web Content Caching and Distribution (IWCW '04), pp. 233-246, 2004.
[18] A. Singh, T.-W.J. Ngan, P. Druschel, and D.S. Wallach, “Eclipse Attacks on Overlay Networks: Threats and Defenses,” Proc. IEEE INFOCOM '06, pp. 120-130, 2006.
[19] N. Daswani and H. Garcia-Molina, “Query-Flood DoS Attacks in Gnutella,” Proc. Ninth ACM Conf. Computer and Comm. Security (CCS '02), pp. 181-192, 2002.
[20] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. IEEE INFOCOM '04, vol. 1, pp. 120-130, 2004.
[21] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. Multimedia Computing and Networking Conf. (MMCN '02), pp. 156-170, 2002.
[22] C.R. Palmer and J.G. Steffan, “Generating Network Topologies That Obey Power Laws,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '00), pp. 434-438, 2000.
[23] Statistics, Gnutella-Like Networks, http://www.limewire.com/english/contentuastats.shtml , 2007.
[24] N. Christin, A.S. Weigend, and J. Chuang, “Content Availability, Pollution and Poisoning in File Sharing P2P Networks,” Proc. Sixth ACM Conf. Electronic Commerce (EC '05), pp. 68-77, 2005.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool