TY - GEN
T1 - Optimizing the throughput of data-driven based streaming in heterogeneous overlay network
AU - Zhang, Meng
AU - Chen, Chunxiao
AU - Xiong, Yongqiang
AU - Zhang, Qian
AU - Yang, Shiqiang
PY - 2007
Y1 - 2007
N2 - Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes randomly select their neighbors to form an unstructured overlay mesh (gossip-style overlay construction) and then each node requests desired data blocks from its neighbors (block scheduling). To improve the performance, most of existing works focus on the gossip-style overlay construction issue; however few concentrate on optimizing the block scheduling for improving the throughput of a constructed overlay, especially in heterogeneous environment. In this paper, we propose a scheme to optimize the throughput of data-driven streaming systems in heterogeneous overlay network. We first model the block scheduling problem as a classical min-cost flow problem and thereby derive a global optimal solution. Based on this idea, we then propose DONLE - a fully distributed asynchronous scheduling algorithm. Simulation results verify that DONLE is superior to a number of conventional strategies.
AB - Recently, much attention has been paid on data-driven (or swarm-like) based live streaming systems due to its rapid growth in deployment over Internet. In such systems, nodes randomly select their neighbors to form an unstructured overlay mesh (gossip-style overlay construction) and then each node requests desired data blocks from its neighbors (block scheduling). To improve the performance, most of existing works focus on the gossip-style overlay construction issue; however few concentrate on optimizing the block scheduling for improving the throughput of a constructed overlay, especially in heterogeneous environment. In this paper, we propose a scheme to optimize the throughput of data-driven streaming systems in heterogeneous overlay network. We first model the block scheduling problem as a classical min-cost flow problem and thereby derive a global optimal solution. Based on this idea, we then propose DONLE - a fully distributed asynchronous scheduling algorithm. Simulation results verify that DONLE is superior to a number of conventional strategies.
UR - https://openalex.org/W1499254751
UR - https://www.scopus.com/pages/publications/84886424136
U2 - 10.1007/978-3-540-69423-6_46
DO - 10.1007/978-3-540-69423-6_46
M3 - Conference Paper published in a book
SN - 9783540694212
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 475
EP - 484
BT - Advances in Multimedia Modeling - 13th International Multimedia Modeling Conference, MMM 2007, Proceedings
T2 - 13th International Multimedia Modeling Conference, MMM 2007
Y2 - 9 January 2007 through 12 January 2007
ER -