A HEURISTIC CHUNK SCHEDULING ALGORITHM REDUCING DELAY FOR MESH-PULL P2P LIVE STREAMING

摘要：

Many Mesh-Pull P2P live streaming systems deployed in Internet catch a large number of users during recent years. While they have high scalability and low cost, they suffer from bad delay performance. In this paper, we aim at reducing the delay caused by chunk scheduling for Mesh-Pull P2P live streaming in the environment of heterogeneous upload bandwidth, heterogeneous and dynamic propagation delays. And we quantify and model the delivery latency of chunk scheduling as an optimization problem by introducing the propagation delay(usually ignored) between peers to the design of chunk scheduling, and put forward a heuristic pull-based chunk scheduling algorithm. Through simulation, our algorithm can adapt to random variance of propagation delays and outperform the two classical Mesh-Pull chunk scheduling algorithms not only in delay performance but also in chunk loss ratio.

关键词： P2P Streaming Chunk Scheduling Delay Chunk Priority Neighbor Selection

作者: Chen Wei Shuang Kai Su Sen Yang Fangchun

作者单位: State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications, Beijing

会议类型: 国际会议

会议名称: 2009 2nd IEEE International Conference on Broadband Network & Multimedia Technology(2009年宽带网络与多媒体国际会议 IEEE IC-BNMT2009)

会议地点: 北京

会议语种:英文

页码: 706-710

在线出版日期: 2009-10-18（万方平台首次上网日期，不代表论文的发表时间）