The Community for Technology Leaders
RSS Icon
Issue No.01 - January (2009 vol.20)
pp: 97-110
Meng Zhang , Tsinghua Univeristy, Beijing
Yongqiang Xiong , Microsoft Research Asia, Beijing
Qian Zhang , Hong Kong University of Science and Technology, Hong Kong
Lifeng Sun , Tsinghua Univeristy, Beijing
Shiqiang Yang , Tsinghua Univeristy, Beijing
During recent years, the Internet has witnessed a rapid growth in deployment of data-driven (or swarming based) peer-to-peer (P2P) media streaming. In these applications, each node independently selects some other nodes as its neighbors (i.e. gossip-style overlay construction), and exchanges streaming data with the neighbors (i.e. data scheduling). To improve the performance of such protocol, many existing works focus on the gossip-style overlay construction issue. However, few of them concentrate on optimizing the streaming data scheduling to maximize the throughput of a constructed overlay. In this paper, we analytically study the scheduling problem in data-driven streaming system and model it as a classical min-cost network flow problem. We then propose both the global optimal scheduling scheme and distributed heuristic algorithm to optimize the system throughput. Furthermore, we introduce layered video coding into data-driven protocol and extend our algorithm to deal with the end-host heterogeneity. The results of simulation with the real world traces indicate that our distributed algorithm significantly outperforms conventional ad hoc scheduling strategies especially in stringent buffer and bandwidth constraints.
peer-to-peer, data-driven, block scheduling, min-cost flow, throughput, delivery ratio
Meng Zhang, Yongqiang Xiong, Qian Zhang, Lifeng Sun, Shiqiang Yang, "Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 1, pp. 97-110, January 2009, doi:10.1109/TPDS.2008.69
[1] Gridmedia, http:/, 2006.
[2] Pplive, http:/, 2008.
[3] Zatto, http:/, 2008.
[4] V. Pai et al., “Chainsaw: Eliminating Trees from Overlay Multicast,” Proc. IEEE INFOCOM '05, Feb. 2005.
[5] V. Agarwal and R. Rejaie, “Adaptive Multi-Source Streaming in Heterogeneous Peer-to-Peer Networks,” Proc. Multimedia Computing and Networking (MMCN '05), Jan. 2005.
[6] X. Zhang, J. Liu, B. Li, and T.-S.P. Yum, “Coolstreaming/Donet: A Data-Driven Overlay Network for Efficient Media Streaming,” Proc. IEEE INFOCOM '05, Mar. 2005.
[7] M. Zhang, J.-G. Luo, L. Zhao, and S.-Q. Yang, “A Peer-to-Peer Network for Live Media Streaming Using a Push-Pull Approach,” Proc. ACM Multimedia, Nov. 2005.
[8] N. Magharei and R. Rejaie, “Prime: Peer-to-Peer Receiver-Driven Mesh-Based Streaming,” Proc. IEEE INFOCOM '07, May 2007.
[9] B. Cohen, http:/, 2008.
[10] V. Venkataraman and P. Francis, “Chunkyspread: Multi-Tree Unstructured End System Multicast,” Proc. Int'l Workshop Peer-to-Peer Systems (IPTPS '06), Feb. 2006.
[11] V. Venkataraman and P. Francis, “On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks,” Proc. IEEE INFOCOM '06, Apr. 2006.
[12] J. Jiang and K. Nahrstedt, “Randpeer: Membership Management for QoS Sensitive Peer-to-Peer Applications,” Proc. IEEE INFOCOM '06, Apr. 2006.
[13] D. Kostic et al., “Maintaining High Bandwidth under Dynamic Network Conditions,” Proc. Usenix Ann. Technical Conf., 2005.
[14] A.R. Bharambe, C. Herley, and V.N. Padmanabhan, “Analyzing and Improving a Bittorrent Networks Performance Mechanisms,” Proc. IEEE INFOCOM '06, Apr. 2006.
[15] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
[16] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proc. ACM/SPIE Multimedia Computing and Networking (MMCN), 2002.
[17] S. McCanne, V. Jacobson, and M. Vetterli, “Receiver-Driven Layered Multicast,” Proc. ACM SIGCOMM '96, Sept. 1996.
[18] Y. Cui and K. Nahrstedt, “Layered Peer-to-Peer Streaming,” Proc. Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2003.
[19] J. Zhao, F. Yang, Q. Zhang, Z. Zhang, and F. Zhang, “Lion: Layered Overlay Multicast with Network Coding,” IEEE Trans. Multimedia, vol. 8, no. 5, Oct. 2006.
[20] K.C. Ellen, W. Zegura, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM, 1996.
[21] A. Goldberg, Andrew Goldberg's Network Optimization Library,, 2008.
[22] N. Magharei and R. Rejaie, “Understanding Mesh Based Peer-to-Peer Streaming,” Proc. ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV), 2006.
[23] M. Zhang, L. Zhao, Y. Tang, J. Luo, and S. Yang, “Large-Scale Live Media Streaming over Peer-to-Peer Networks through Global Internet,” Proc. ACM Workshop Advances in Peer-to-Peer Multimedia Streaming (P2PMMS '05), pp. 21-28, Nov. 2005.
[24] CCTV Online TV,, 2007.
[25] Y. Chu, S. Rao, and H. Zhang, “A Case for End System Multicast,” Proc. ACM Sigmetrics '00, June 2000.
[26] index.html, 2002.
[27] D. Li, Y. Cui, K. Xu, and J. Wu, “Segment-Sending Schedule in Data-Driven Overlay Network,” Proc. IEEE Int'l Conf. Comm. (ICC), 2006.
[28] China Central Radio and TV University, http:/www.crtvu., 2006.
[29] S. Banerjee and B. Bhattacharjee, A Comparative Study of Application Layer Multicast Protocols,, 2002.
[30] P. Francis, Yoid: Extending the Internet Multicast Architecture, white paper, http://www.icir.orgyoid/, 2006.
[31] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, “Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,” IEEE J. Selected Areas in Comm., vol. 20, no. 8, 2002.
[32] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A.I.T. Rowstron, and A. Singhr, “Splitstream: High-Bandwidth Multicast in Cooperative Environments,” Proc. Symp. Operating Systems Principles (SOSP '03), Oct. 2003.
[33] N. Magharei, R. Rejaie, and Y. Guo, “Mesh or Multiple-Tree: A Comparative Study of P2P Live Streaming Services,” to appear in Proc. IEEE INFOCOM '07, May 2007.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool