This Article 
 Bibliographic References 
 Add to: 
On Game Theoretic Peer Selection for Resilient Peer-to-Peer Media Streaming
October 2009 (vol. 20 no. 10)
pp. 1512-1525
Mark Kai Ho Yeung, University of Hong Kong, Hong Kong
Yu-Kwong Kwok, Colorado State University, Fort Collins
Peer-to-peer (P2P) media streaming quickly emerges as an important application over the Internet. A plethora of approaches have been suggested and implemented to support P2P media streaming. In our study, we first classified existing approaches and studied their characteristics by looking at three important quantities: number of upstream peers (parents), number of downstream peers (children), and average number of links per peer. In existing approaches, peers are assigned with a fixed number of parents without regard to their contributions, measured by the amount of outgoing bandwidths. Obviously, this is an undesirable arrangement as it leads to highly inefficient use of the P2P links. This observation motivates us to model the peer selection process as a cooperative game among peers. This results in a novel peer selection protocol such that the number of upstream peers of a peer is related to its outgoing bandwidth. Specifically, peers with larger outgoing bandwidth are given more parents, which make them less vulnerable to peer dynamics. Simulation results show that the proposed protocol improves delivery ratio using similar number of links per peer, comparing with existing approaches under a wide range of system parameters.

[1] M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel, and D.D. Yao, “Optimal Peer Selection for P2P Downloading and Streaming,” Proc. IEEE INFOCOM '05, vol. 3, pp. 1538-1549, Mar. 2005.
[2] S. Androutsellis-Theotokis and D. Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, Dec. 2004.
[3] P. Baccichet, N. Jeonghun, E. Setton, and B. Girod, “Content-Aware P2P Video Streaming with Low Latency,” Proc. IEEE Int'l Conf. Multimedia and Expo (ICME '07), pp. 400-403, July 2007.
[4] BitTorrent, http:/, 2008.
[5] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, “SplitStream: High-Bandwidth Multicast in Cooperative Environments,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 298-313, Oct. 2003.
[6] Y. Chu, S. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Muilticast Architecture,” ACM SIGCOMM Computer Comm. Rev., vol. 31, no. 4, pp. 55-67, Aug. 2001.
[7] H. Deshpande, M. Bawa, and H. Garcia-Molina, “Streaming Live Media over a Peer-to-Peer Network,” technical report, Stanford InfoLab, Aug. 2001.
[8] P.B. Godfrey, S. Shenker, and I. Stoica, “Minimizing Churn in Distributed Systems,” ACM SIGCOMM Computer Comm. Rev., vol. 36, no. 4, pp. 147-158, Aug. 2006.
[9] V.K. Goyal, “Multiple Description Coding: Compression Meets the Network,” IEEE Signal Processing Magazine, pp. 74-93, Sept. 2001.
[10] GT-ITM: Georgia Tech Internetwork Topology Models,, 2009.
[11] J. Jannotti, D.K. Gifford, and K.L. Johnson, “Overcast: Reliable Multicasting with an Overlay Network,” Proc. Fourth Usenix Symp. Operating Systems Design and Implementation (OSDI '00), Oct. 2000.
[12] D. Kostić, A. Rodriguez, J. Albrecht, and A. Vahdat, “Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 282-297, Oct. 2003.
[13] J. Liang and K. Nahrstedt, “DagStream: Locality Aware and Failure Resilient Peer-to-Peer Streaming,” Proc. SPIE Multimedia Computing and Networking (MMCN '06), vol. 6071, Jan. 2006.
[14] C. Liang, Y. Guo, and Y. Liu, “Hierarchically Clustered P2P Streaming System,” Proc. Global Telecomm. Conf. (GLOBECOM '07), pp. 236-241, Nov. 2007.
[15] V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, and A.E. Mohr, “Chainsaw: Eliminating Trees from Overlay Multicast,” Proc. Fourth Int'l Workshop Peer-to-Peer Systems (IPTPS '05), pp. 127-140, Feb. 2005.
[16] W.T. Ooi, “Dagster: Contributor-Aware End-Host Multicast for Media Streaming in Heterogeneous Environment,” Proc. SPIE Multimedia Computing and Networking (MMCN '05), vol. 5680, pp.77-90, Jan. 2005.
[17] M.J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, July 1994.
[18] J. She and P.-H. Ho, “Cooperative Coded Video Multicast for IPTV Services under EPON-WiMAX Integration,” IEEE Comm. Magazine, pp. 104-110, Aug. 2008.
[19] K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, “The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points,” Proc. ACM SIGCOMM '04, vol. 34, no. 4, pp. 107-120, Aug. 2004.
[20] D.A. Tran, K.A. Hua, and T. Do, “ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,” Proc. IEEE INFOCOM '03, vol. 2, pp. 1283-1292, Mar./Apr. 2003.
[21] D.A. Tran, K.A. Hua, and T.T. Do, “A Peer-to-Peer Architecture for Media Streaming,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 121-133, Jan. 2004.
[22] Y.-C. Tu, J. Sun, M. Hefeeda, and S. Prabhakar, “An Analytical Study of Peer-to-Peer Media Streaming Systems,” ACM Trans. Multimedia Computing, Comm., and Applications, vol. 1, no. 4, pp.354-376, Nov. 2005.
[23] V. Venkataraman, P. Francisy, and J. Calandrino, “Chunkyspread: Multi-Tree Unstructured Peer-to-Peer Multicast,” Proc. Fifth Int'l Workshop Peer-to-Peer Systems (IPTPS '06), Feb. 2006.
[24] F. Wang, Y. Xiong, and J. Liu, “mTreebone: A Hybrid Tree/Mesh Overlay for Application-Layer Live Video Multicast,” Proc. Int'l Conf. Distributed Computing Systems (ICDCS '07), June 2007.
[25] J.D. Weisz, S. Kiesler, H. Zhang, Y. Ren, R.E. Kraut, and J.A. Konstan, “Watching Together: Integrating Text Chat with Video,” Proc. ACM SIGCHI '07, pp. 877-886, Apr./May 2007.
[26] F. Xue and P.R. Kumar, “The Number of Neighbors Needed for Connectivity of Wireless Networks,” Proc. Wireless Networks, vol. 10, no. 2, pp. 169-181, Mar. 2004.
[27] M.K.H. Yeung, “Non-Cooperative Peer-to-Peer Media Streaming: Game Theoretic Analysis and Algorithms,” PhD dissertation, Univ. of Hong Kong, Aug. 2007.
[28] M.K.H. Yeung and Y.-K. Kwok, “Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic,” IEEE Trans. Mobile Computing, vol. 4, no. 1, pp. 68-83, Jan./Feb. 2005.
[29] M.K.H. Yeung and Y.-K. Kwok, “A Game Theoretic Approach to Power Aware Wireless Data Access,” IEEE Trans. Mobile Computing, vol. 5, no. 8, pp. 1057-1073, Aug. 2006.
[30] M. Zhang, L. Zhao, Y. Tang, J.-G. Luo, and S.-Q. Yang, “Large-Scale Live Media Streaming over Peer-to-Peer Networks through Global Internet,” Proc. Workshop Advances in Peer-to-Peer Multimedia Streaming (P2PMMS '05), pp. 21-28, Nov. 2005.
[31] X. Zhang, J. Liu, B. Lim, and T.-S.P. Yum, “CoolStreaming/DONet: A Data-Driven Overlay Network for Peer-to-Peer Live Media Streaming,” Proc. IEEE INFOCOM '05, vol. 3, pp. 2102-2111, Mar. 2005.

Index Terms:
P2P media streaming, coalition, incentives, cooperative game, structured P2P topology, unstructured P2P topology, peer selection.
Mark Kai Ho Yeung, Yu-Kwong Kwok, "On Game Theoretic Peer Selection for Resilient Peer-to-Peer Media Streaming," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 10, pp. 1512-1525, Oct. 2009, doi:10.1109/TPDS.2008.253
Usage of this product signifies your acceptance of the Terms of Use.