分组调度算法在不同权重分布下的时延性能

Delay Performance of Packet Scheduling Algorithms Versus Weight Distribution

分组调度算法是网络 Qo S体系结构中的一个重要组成部分。从业务流的权重分布和流量类型两个角度 ,通过仿真实验 ,比较了基于时标算法 WF2 Q+和轮循算法 DRR,研究了它们的时延性能与流的权重分布、流量类型之间的关系。WF2 Q+在任意的权重分布时都具有最佳的时延性能 ,而 DRR时延性能的优劣与流的权重分布有关系 ;流量的类型和突发度对两种调度算法的时延性能没有影响。

A key component in the QoS architecture of the network is packet scheduling algorithms. In this paper, by extensive simulations from the points of view of traffic flow weight distribution and traffic pattern, the typical time-stamp algorithm WF^2Q+(Worst-case Fair Weighted Fair Queuing+) is compared with the typical round robin based algorithm DRR (Deficit Round Robin), and the relations between the delay performance and flows weight distribution, traffic patterns investigated. WF^2Q+ has the best delay performance for any flow weight distribution, but DRR delay performance is dependent on flow weight distribution. The type and burstiness of flows have little effect on the delay performance of these two algorithms.