A Study on Reducing Chunk Scheduling Delay for Mesh-Based P2P Live Streaming
A Study on Reducing Chunk Scheduling Delay for Mesh-Based P2P Live Streaming
复制标题
DOI：
10.1109/gcc.2008.70
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
Zhengjun Chen;Kaiping Xue;P. Hong
中科院分区：
文献类型：
--
作者：
Zhengjun Chen;Kaiping Xue;P. Hong
P2P流媒体服务近年来取得了很大的成功。在本文中，我们解决的块调度算法的设计，实现低延迟的块分发。提出了一种基于优先级的分布式组块调度算法（DPC算法）。在均匀环境下，该方案可以逼近最小时延界。我们还扩展了我们的DPC算法的一般异构的情况下，对等端有不同的上传带宽。仿真结果表明，基于优先级的组块调度算法性能接近理论界，能够满足P2P流媒体应用的连续性要求。
P2P streaming services have been gaining much success in recent years. In this paper, we address the design of chunk scheduling algorithm which achieves low delay for chunk distribution. We propose a distributed priority-based chunk scheduling algorithm (DPC algorithm). The proposed scheme can approach the minimum delay bound in homogeneous environment. We also extend our DPC algorithm to a general heterogeneous case where peers have different upload bandwidth. Simulation results show the priority-base chunk scheduling algorithm performs close to the theoretical bound, and suits continuity requirement of P2P streaming application.