Issue No. 01 - January (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.69
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
S. Yang, M. Zhang, L. Sun, Y. Xiong and Q. Zhang, "Optimizing the Throughput of Data-Driven Peer-to-Peer Streaming," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 97-110, 2008.