一种改进的DRR调度算法  

AN IMPROVEMENT OF DRR PACKET SCHEDULING ALGORITHM

作　　者：伍翔[1] 孔红伟[1] 汪卫章[1] 葛宁[1] 冯重熙[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《电子与信息学报》2003年第5期704-710,共7页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(69896240)

摘　　要：为了简单有效地分配链路带宽,该文分析了 DRR(Deficit Round Robin)算法在数据交换实现上的局限性,提出了一种基于令牌扣除并平滑输出突发性的调度算法。该算法能够减小调度开销,平滑输出突发性,硬件实现简单。证明了在多数情况下改进算法的公平性优于 DRR算法。仿真结果表明改进算法能够有效地分配输出链路的带宽,缓解令牌数选取对输出突发性和抖动性的影响。In order to allocate the bandwidth more efficiently and simply, this paper analyzes the limitation of the DRR(Deficit Round Robin) algorithm in the packet switch, and proposes an algorithm based on deducting credit and interleaving the output packets. The improved algorithm lowers the scheduling overhead, smoothes the output burst and is very simple for hardware implementation. Analysis indicates the improved algorithm has better fairness over DRR in many cases. Results from analysis show that the scheme is able to maintain bandwidth and is affected by the number of credits less.

关 键 词：DRR 调度算法 链路带宽 数据交换 突发性 抖动性 

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