This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks
August 2011 (vol. 22 no. 8)
pp. 1342-1349
Zhenyu Li, Institute of Computing Technology, Chinese Academy of Sciences, Beijing
Gaogang Xie, Institute of Computing Technology, Chinese Academy of Sciences, Beijing
Kai Hwang, University of Southern California, Los Angeles
Zhongcheng Li, Institute of Computing Technology, Chinese Academy of Sciences, Beijing
Massive data dissemination is often disrupted by frequent join and departure or failure of client nodes in a peer-to-peer (P2P) network. We propose a new churn-resilient protocol (CRP) to assure alternating path and data proximity to accelerate the data dissemination process under network churn. The CRP enables the construction of proximity-aware P2P content delivery systems. We present new data dissemination algorithms using this proximity-aware overlay design. We simulated P2P networks up to 20,000 nodes to validate the claimed advantages. Specifically, we make four technical contributions: 1). The CRP scheme promotes proximity awareness, dynamic load balancing, and resilience to node failures and network anomalies. 2). The proximity-aware overlay network has a 28-50 percent speed gain in massive data dissemination, compared with the use of scope-flooding or epidemic tree schemes in unstructured P2P networks. 3). The CRP-enabled network requires only 1/3 of the control messages used in a large CAM-Chord network. 4) Even with 40 percent of node failures, the CRP network guarantees atomic broadcast of all data items. These results clearly demonstrate the scalability and robustness of CRP networks under churn conditions. The scheme appeals especially to web-scale applications in digital content delivery, network worm containment, and consumer relationship management over hundreds of datacenters in cloud computing services.

[1] S. Agarwal and J.R. Lorch, "Matchmaking for Online Games and Other Latency-Sensitive P2P Systems," Proc. ACM SIGCOMM, Aug. 2009.
[2] M. Bishop, S. Rao, and K. Sripanidkulchai, "Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments," Proc. IEEE INFOCOM, Apr. 2006.
[3] M. Castro et al., "SCRIBE: A Large-Scale and Decentralized Application-Level Multicast Infrastructure," IEEE J. Selected Areas in Commun., vol. 20, no. 8, pp. 1489-1499, Oct. 2002.
[4] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-Bandwidth Multicast in Cooperative Environments," Proc. ACM Symp. Operating Systems Principles, Oct. 2003.
[5] V. Cerny, "Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm," J. Optimization Theory and Applications, vol. 45, pp. 41-51, 1985.
[6] S. Chen, B. Shi, S. Chen, and Y. Xia, "ACOM: Capacity-Constrained Overlay Multicast in Non-DHT P2P Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 9, pp. 1188-1201, Sept. 2007.
[7] C. Diot, B.N. Levine, B. Lyles, H. Kassem, and D. Balensiefen, "Deployment Issues for the IP Multicast Service and Architecture," IEEE Network, vol. 14, no. 1, pp. 78-88, Jan./Feb. 2000.
[8] A.J. Ganesh, A.M. Kermarrec, and L. Massoulié, "Peer-to-Peer Membership Management for Gossip-Based Protocols," IEEE Trans. Computers, vol. 52, no. 2, pp. 139-149, Feb. 2003.
[9] H. Hsiao, H. Liao, and C. Huang, "Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 11, pp. 1668-1681, Nov. 2009.
[10] K. Hwang, G. Fox, and J. Dongarra, Distributed Systems and Cloud Computing, to be published Morgan Kauffmann.
[11] X. Jin, G. Chan, W.-C. Wong, and A.C. Begen, "A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming," IEEE Trans. Parallel and Distributed Systems, vol. 21, no. 2, pp. 216-228, Feb. 2010.
[12] A.-M. Kermarrec, L. Massoulie, and A.J. Ganesh, "Probabilistic Reliable Dissemination in Large-Scale Systems," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248-258, Mar. 2003.
[13] J. Leitao, J. Pereira, and L. Rodrigues, "Epidemic Broadcast Trees," Proc. 26th IEEE Int'l Symp. Reliable Distributed Systems, Oct. 2007.
[14] Z. Li, G. Xie, and Z. Li, "Towards Reliable and Efficient Data Dissemination in Heterogeneous Peer-to-Peer Systems," Proc. IEEE Int'l Symp. Parallel and Distributed Processing, Apr. 2008.
[15] N. Magharei and R. Rejaie, "PRIME: Peer-to-Peer Receiver-Driven MEsh-Based Streaming," IEEE/ACM Trans. Networking, vol. 17, no. 4, pp. 1052-1065, Aug. 2009.
[16] L. Massoulie, A.-M. Kermarrec, and A.J. Ganesh, "Network Awareness and Failure Resilience in Self-Organizing Overlay Networks," Proc. IEEE Symp. Reliable Distributed Systems, Oct. 2003.
[17] V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A. Mohr, "Chainsaw: Eliminating Trees from Overlay Multicast," Proc. Int'l Workshop P2P Systems, Feb. 2005.
[18] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologically -Aware Overlay Construction and Server Selection," Proc. IEEE INFOCOM, June 2002.
[19] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware), Nov. 2001.
[20] I. Stoica et al., "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," ACM/IEEE Trans. Networking, Feb. 2003.
[21] C. Tang, R.N. Chang, and C. Ward, "GoCast: Gossip-enhanced Overlay Multicast for Fast and Dependable Group Communication," Proc. Int'l Conf. Dependable Systems and Networks, June 2005.
[22] V. Venkataraman, K. Yoshida, and P. Francis, "Chunkyspread: Heterogeneous Unstructured Tree-Based Peer to Peer Multicast," Proc. IEEE Int'l Conf. Network Protocols, Nov. 2006.
[23] Z. Xu, C. Tang, and Z. Zhang, "Building Topology-Aware Overlays Using Global Soft-State," Proc. Int'l Conf. Distributed Computing Systems, May 2003.
[24] E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, "How to Model an Internetwork," Proc. IEEE INFOCOM, Mar. 1996.
[25] Z. Zhang, S. Chen, Y. Ling, and R. Chow, "Capacity-Aware Multicast Algorithms in Heterogeneous Overlay Networks," IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 2, pp. 135-147, Feb. 2006.
[26] X. Zhang, J. Liu, B. Li, and P. Yum, "DONet/Coolstreaming: A Data-Driven Overlay Network for Live Media Streaming," Proc. IEEE INFOCOM, Mar. 2005.

Index Terms:
P2P networks, data dissemination, multicast algorithms, distributed systems, cloud computing.
Citation:
Zhenyu Li, Gaogang Xie, Kai Hwang, Zhongcheng Li, "Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 8, pp. 1342-1349, Aug. 2011, doi:10.1109/TPDS.2011.15
Usage of this product signifies your acceptance of the Terms of Use.