Quality-aware segment transmission scheduling in peer-to-peer streaming systems
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Linear programming models for multi-channel P2P streaming systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal incentive-based scheduling of layered video packets in P2P streaming
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Improving multi-view peer-to-peer live streaming systems with the divide-and-conquer strategy
Computer Networks: The International Journal of Computer and Telecommunications Networking
Prefetching strategy in peer-assisted social video streaming
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Partial forwarding vs. partial participation for dynamic window resizing in P2P streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and analysis of a p2p-vod system based on stochastic network calculus
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Towards efficient video chunk dissemination in peer-to-peer live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and performance analysis of pull-based live streaming schemes in Peer-to-Peer network
Computer Communications
| Hi-index | 0.00 |
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.