应用加权公平队列的动态QoS调度架构性能分析

An analysis of the delay for weighted fair queue based QoS scheduling architecture

基于星型的网络拓扑,讨论了一种基于加权公平队列的中央节点网络带宽分配算法的性能.重点研究了延迟(即用户节点发送请求,到中央节点实际分配之间的时间差)与公平队列参数的相互关系,并由这些参数导出了平均情况下延迟的上界和下界.研究结果表明:该延迟不但有界,而且与该算法中的参数关系紧密.相对于最大延迟,平均延迟更能反映网络的平均运行情况.

In this paper,an algorithm of the central node＇s bandwidth allocation based on the weighted fair queue is discussed using the star topology.The main focus of the research is to analytically reveal the relationship between the delay and various parameters of the weighted fair queue.An upper bound and a lower bound of the delay were inferred from these parameters in average cases.The research result shows that the delay is not only bounded,but is closely related to these parameters as well.Compared with the maximum delay,the expected delay is a better indicator of the network performance in average cases.