摘要
针对现有的采用拉式策略的算法在进行调度时数据块不能及时到达的情况,提出了一种自适应的数据调度算法。该算法可以根据节点间数据的传输速率以及P2P网络节点的动态性自动调整对数据服务节点的选择,并可以最小化在播放截止时间之前不能到达的数据块的数量。实验结果表明,新的算法可以一定程度缩短每个调度周期的数据到达延迟。
In order to solve the problem that the data block can not arrive in time in the existing algorithm sing pull method,an adaptive data scheduling algorithm is proposed for P2P media streaming. This algorithm an not only choose the server peer automatically according to the transmitting rate and the dynamic feature of P2P networks, but also minimize the quantity of the data block that can not arrive before the playing deadline. ;xperimental results show that the new algorithm can shorten the data arrival latency of every scheduling period ） a certain degree.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2009年第11期2778-2780,共3页
Systems Engineering and Electronics
基金
陕西省科学技术研究发展计划(2008K04-14)
西安市科技计划(YF07012)资助课题
关键词
P2P
流媒体
数据调度
延迟
P2P
media streaming
data scheduling
latency
