针对服从令牌桶模型和同步单元模型的业务源给出了网络时延上限和下限.针对MRC-GR算法实例——具有最大速率控制的最差情形公平加权公平排队(worst-case fair weighted fair queueing with maximum rate control)调度算法进行仿真实验
仿真结果验证了理论分析.
Abstract
A class of maximum rate control-guaranteed rate(MRC-GR) algorithm is advanced
which can provide maximum rate control and guaranteed rate for flows simultaneously.For each network node employing scheduling algorithms belonging to MRC-GR
a method is presented to decide the upper bound and the lower bound on network end-to-end delay
and the delay bounds for source models conforming to token bucket and synchronization unit model are given.Simulations for worst-case fair weighted fair queueing with maximum rate control scheduling algorithm
which is an instance of MRC-GR
are carried on to validate the theoretic analysis.