An adaptive scheduling scheme for fair bandwidth allocation

Class-based service differentiation is provided in DiffServ networks. However, this differentiation will be disordered under dynamic traffic loads due to the fixed weighted scheduling. An adaptive weighted scheduling scheme is proposed in this paper to achieve fair bandwidth allocation among different service classes. In this scheme, the number of active flows and the subscribed bandwidth are estimated based on the measurement of local queue metrics, then the scheduling weights of each service class are adjusted for the per-flow fairness of excess bandwidth allocation. This adaptive scheme can be combined with any weighted scheduling algorithm. Simulation results show that, comparing with fixed weighted scheduling, it effectively improve the fairness of excess bandwidth allocation.

区分服务网络中主动队列管理算法

现有区分服务网络的保证转发服务可提供稳定的带宽保证,但缺乏保证时延和分组丢失性能的有效方案.基于对RIO队列的稳态性能分析,提出两种自适应调整控制策略的主动队列管理算法(ARIO-D和ARIO-L).仿真结果表明,这两种算法在保持RIO算法带宽保证能力的同时,还可以提供稳定的和可区分的时延和分组丢失性能.采用ARIO-D和ARIO-L的保证转发服务可以为多媒体流量提供多种服务质量的定量保证. Current assured forwarding (AF) service in differentiated services (DiffServ) networks can provide stable guarantees in throughput, but is lacking of efficient schemes in ensuring queuing delay and loss ratio. By analyzing the steady state operating point of RIO, this paper proposes two active queue management algorithms with adaptive control policy, namely ARIO-D and ARIO-L. These two algorithms can provide differentiated performance in, respectively, queuing delay and loss ratio, in addition to throughput guarantee. By deploying ARIO-D and ARIO-L, AF service can provide quantitative guarantees for multimedia traffic with multiple QoS metrics.