On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks Export

@inproceedings{optimal_throughput_LP_pull, abstract = {The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each node independently selects some other nodes as its neighbors (i.e. overlay construction), and exchanges streaming data with these neighbors (i.e. data scheduling). This scheme improves the robustness of the system. However, most of the work in the literature focused on the construction problem, and very few addressed its scheduling problem which is also very important for the overall performance. In this paper, we analytically study the scheduling problem in DON 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 maximize the system throughput. Experimental results indicate that our algorithms outperform other schemes and the throughput gain is up to 80\%.}, author = {Zhang, Meng and Xionq, Yongqiang and Zhang, Qian and Yang, Shiqiang}, booktitle = {Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE}, citeulike-article-id = {5187551}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/GLOCOM.2006.212}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4150842}, doi = {10.1109/GLOCOM.2006.212}, journal = {Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE}, keywords = {data-driven, mesh, overlay, pull, streaming}, pages = {1--5}, posted-at = {2009-07-17 03:14:11}, priority = {2}, title = {On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks}, url = {http://dx.doi.org/10.1109/GLOCOM.2006.212}, year = {2006} }

TY - CONF ID - optimal_throughput_LP_pull L3 - citeulike-article-id:5187551 N2 - The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each node independently selects some other nodes as its neighbors (i.e. overlay construction), and exchanges streaming data with these neighbors (i.e. data scheduling). This scheme improves the robustness of the system. However, most of the work in the literature focused on the construction problem, and very few addressed its scheduling problem which is also very important for the overall performance. In this paper, we analytically study the scheduling problem in DON 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 maximize the system throughput. Experimental results indicate that our algorithms outperform other schemes and the throughput gain is up to 80%. JF - Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE EP - 5 TI - On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks T2 - Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE SP - 1 KW - data-driven KW - mesh KW - overlay KW - pull KW - streaming AU - Zhang, Meng AU - Xionq, Yongqiang AU - Zhang, Qian AU - Yang, Shiqiang PY - 2006/// UR - http://dx.doi.org/10.1109/GLOCOM.2006.212 ER -