LL-DRR:一种有效的用于高速分组网络的调度算法  

LL-DRR: AN EFFICIENT SCHEDULING ALGORITHM FOR PACKET NETWORKS

作　　者：涂晓东[1] 李乐民[1] 

机构地区：[1]电子科技大学光纤通信国家重点实验室,成都610054

出　　处：《电子与信息学报》2002年第3期361-369,共9页Journal of Electronics & Information Technology

基　　金：信息产业部电子科学技术研究院预研项目资金;深圳华为科技基金;国家自然科学基金(No.69882003);博士点专项科研基金(No.98061409)

摘　　要：该文在亏空轮循(Deficit Round Robin,DRR)算法的基础上提出了一种新的适用于变长分组的调度算法—低时延亏空轮循(Low Latency Deficit Round Robin,LL-DRR)。仿真和理论分析表明,在时延性能上LL-DRR比DRR有显著的改善,并具有连接的最大时延与连接数无关的特性,可以支待实时业务。LL-DRR继承了DRR在平均吞吐率上的公平性。LL-DRR易于实现且适用于高速网络。A novel fair queuing algorithm LL-DRR(Low Latency Deficit R.ound Robin)is proposed in this paper, which is based on DRR(Deficit Round Robin) algorithm and suitable to schedule variable length packets. The simulation and theoretical analysis show that the delay performance of LL-DRR is much better than DRR, and the maximum packet delay of a session in LL-DR.R is independent of the number of sessions. LL-DRR can support real time service. LL-DR.R, inherits the fairness of DRR on average throughput. LL-DRR is simple to implement and applicable to high speed networks.

关 键 词：低时延亏空轮循 高速分组网络 调度算法 

分 类 号：TN919.21[电子电信—通信与信息系统]