带宽超配条件下分组调度算法的时延性能研究  

Delay Performance of Packet Scheduling Algorithm Based on Bandwidth Over-configuring

作　　者：董民[1] 许晓明[2] 齐望东[3] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210007 [2]解放军理工大学通信工程学院研究生4队 [3]解放军理工大学指挥信息系统学院

出　　处：《军事通信技术》2014年第4期18-24,共7页Journal of Military Communications Technology

摘　　要：基于目前的大带宽网络背景,作为权衡分组调度算法时延性能和时间复杂度之间矛盾的一种方法,文中仿真研究了轮循类分组调度算法在"带宽超配"条件下的时延性能。仿真结果表明:在大多数的网络想定中,为业务流超配少量的链路带宽,轮循类分组调度算法的时延性能就可以得到很好的改善,最终与WF2 Q一致,而且改进型的轮循类算法SRR的带宽超配量要小于传统型的DRR算法。此外,系统中业务流的流数、流量源的类型以及流量的突发度对轮循类算法时延性能的改善影响不大。因此,具有O(1)时间复杂度的轮循类分组调度算法在链路带宽超配条件下也可以像时标类算法一样为业务流提供QoS保证。Under the broad-bandwidth background,as a method for balancing the conflict between delay performance and time complexity of packet scheduling algorithms,a method of bandwidth over-configuring was proposed to improve the delay performance of round robin based packet scheduling algorithms.The experiment results indicate that the delay performance of round robin based schedulers is improved so as to reach WF2 Q with a little bandwidth over-configuring in most network scenarios,and that SRR as representation of improved round robin based scheduler need less bandwidth over-configuring amount than the traditional DRR scheduler,and that the number,type and burstiness of flows have little effect on the improvement of the delay performance of round robin based schedulers.Therefore,round robin based packet scheduler with O（1）time complexity can provide QoS guarantees for service flows as time stamp based schedulers under the condition of link bandwidth over-configuring.

关 键 词：带宽超配 轮循类分组调度算法 时延性能 

分 类 号：TN915[电子电信—通信与信息系统]