The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2010 vol.59)
pp: 1158-1171
Min Yang , SUNY at Stony Brook University, Stony Brook
Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected by a regular topology, and unstructured peer-to-peer networks in which the topology is arbitrary. Structured peer-to-peer networks usually can provide efficient and accurate services but need to spend a lot of effort in maintaining the regular topology. On the other hand, unstructured peer-to-peer networks are extremely resilient to the frequent peer joining and leaving but this is usually achieved at the expense of efficiency. The objective of this work is to design a hybrid peer-to-peer system for distributed data sharing which combines the advantages of both types of peer-to-peer networks and minimizes their disadvantages. The proposed hybrid peer-to-peer system is composed of two parts: the first part is a structured core network which forms the backbone of the hybrid system; the second part is made of multiple unstructured peer-to-peer networks each of which is attached to a node in the core network. The core structured network can narrow down the data lookup within a certain unstructured network accurately, while the unstructured networks provide a low-cost mechanism for peers to join or leave the system freely. A data lookup operation first checks the local unstructured network, and then, the structured network. This two-tier hierarchy can decouple the flexibility of the system from the efficiency of the system. Our simulation results demonstrate that the hybrid peer-to-peer system can utilize both the efficiency of structured peer-to-peer network and the flexibility of the unstructured peer-to-peer network and achieve a good balance between the two types of networks.
Peer-to-peer systems, P2P, structured peer-to-peer, unstructured peer-to-peer, hybrid, overlay networks.
Min Yang, "An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing", IEEE Transactions on Computers, vol.59, no. 9, pp. 1158-1171, September 2010, doi:10.1109/TC.2009.175
[1] E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes," IEEE Comm. Surveys and Tutorials, vol. 7, no. 2, pp. 72-93, Mar. 2005.
[2] S. Sen and J. Wang, "Analyzing Peer-to-Peer Traffic Across Large Networks," Proc. Internet Measurement Workshop, Nov. 2002.
[3] Y. Chu, S. Rao, and H. Zhang, "A Case for End System Multicast," Proc. ACM Sigmetrics '00, pp. 1-12, June 2000.
[4] E. Brosh and Y. Shavitt, "Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees," Proc. IEEE INFOCOM '04, Mar. 2004.
[5] M. Freedman and R. Morris, "Tarzan: A Peer-to-Peer Anonymizing Network Layer," Proc. Ninth ACM Conf. Computer and Comm. Security, Nov. 2002.
[6] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, "Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications," Proc. IEEE INFOCOM '03, pp. 1521-1531, Mar. 2003.
[7] S. Iyer, A. Rowstron, and P. Druschel, "Squirrel: A Decentralized, Peer-to-Peer Web Cache," Proc. 21st Ann. ACM Symp. Principles of Distributed Computing (PODC), 2002.
[8] A.R. Bharambe, S.G. Rao, V.N. Padmanabhan, S. Seshan, and H. Zhang, "The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols," Proc. Ann. Int'l Workshop Peer-to-Peer Systems (IPTPS '05), pp. 115-126, Feb. 2005.
[9] D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, and Z. Xu, "Peer-to-Peer Computing," Technical Report HPL-2002-57, HP Labs, Mar. 2002.
[10] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content Addressable Network," Proc. ACM SIGCOMM '01, pp. 161-172, 2001.
[11] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, 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, Feb. 2003.
[12] V. Vishnumurthy and P. Francis, "On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks," Proc. IEEE INFOCOM '06, 2006.
[13] Gnutella Development Forum, The Gnutella v0.6 Protocol, gdffiles /, 2009.
[14] Bittorrent, http:/, 2009.
[15] P. Ganesan, Q. Sun, and H. Garcia-Molina, "YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology," Proc. IEEE INFOCOM '03, pp. 1250-1260, 2003.
[16] B.T. Loo, R. Huebsch, I. Stoica, and J.M. Hellerstein, "The Case for a Hybrid p2p Search Infrastructure," Proc. Workshop Peer-to-Peer Systems (IPTPS '04), pp. 141-150, Feb. 2004.
[17] S. Ratnasamy, M. Handley, R.M. Karp, and S. Shenker, "Topologically-Aware Overlay Construction and Server Selection," Proc. IEEE INFOCOM '02, June 2002.
[18] H. Zhang, G. Neglia, D. Towsley, and G. Lo Presti, "On Unstructured File Sharing Networks," Proc. IEEE INFOCOM '07, pp. 2189-2197, 2007.
[19] M. Zaharia and S. Keshav, "Gossip-Based Search Selection in Hybrid Peer-to-Peer Networks," Proc. Ann. Int'l Workshop Peer-to-Peer Systems (IPTPS), Feb. 2006.
[20] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, "Making Gnutella Like p2p Systems Scalable," Proc. ACM SIGCOMM, Aug. 2003.
[21] S. Saroiu, K. Gummadi, and S. Gribble, "A Measurement Study of Peer-to-Peer File Sharing Systems," Proc. Multimedia Computing and Networking Conf. (MMCN), Jan. 2002.
[22] K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, "Measurement, Modeling and Analysis of a Peer-to-Peer File-Sharing Workload," Proc. ACM Symp. Operating System Principles (SOSP), Dec. 2003.
[23] M.-T. Sun, C.-T. King, W.-H. Sun, and C.-P. Chang, "Attribute-Based Overlay Network for Non-DHT Structured Peer-to-Peer Lookup," Proc. Ann. Int'l Conf. Parallel Processing (ICPP), Sept. 2007.
[24], 2009.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool