摘要
针对现有算法在有限带宽情况下数据块易丢失的问题,提出了一种新颖的数据调度算法——最少优先调度算法(LFSA)。该算法易于实现,并且可以根据网络的异构性,带宽抖动以及P2P网络节点的动态性进行自动调整。实验结果表明,LFSA能够有效缩短系统播放启动延迟,而且可以在不知道伙伴节点带宽和没有任何负载平衡机制的情况下取得比传统策略更好的性能。
In order to solve the problem of losing data block under the limited bandwidth in existed algorithms, a novel scheduling algorithm was proposed for P2P network, named Least-First Scheduling Algorithm (LFSA), which was simple to implement. Furthermore, it can adjust itself automatically to adapt to network heterogeneity, bandwidth fluctuation, and overlay dynamics. Experimental results show that LFSA can shorten the start delay time and achieve better performance than conventional strategies without any knowledge of the bandwidth of its partners or any special mechanism for the load balance.
出处
《计算机应用》
CSCD
北大核心
2008年第3期558-559,567,共3页
journal of Computer Applications
关键词
P2P网络
流媒体
数据调度
启动延迟
P2P network
media streaming
data scheduling
startup latency