基于速率的主动队列管理算法的性能分析

Performance of Rate-based Active Queue Management Algorithm

主动队列管理是解决网络拥塞的主要措施。针对基于队列的主动队列管理算法的不足,提出了一种基于速率的新算法RAQM,该算法以数据到达速率与路由器最大服务速率的差值为指标计算丢包概率,能够快速地对网络流量的变化做出反应,该算法计算简单,而且只需要设置一个参数K。通过现代控制理论分析了RAQM/TCP系统的稳定性。仿真结果表明,RAQM能够维持较低的队列长度并保持队列的稳定,从而减小了分组端到端时延和时延抖动。最后讨论了参数K对算法性能的影响。

As a method of congestion control, Active Queue Management is paid more attention on. In view of the disadvantages of exiting AQM algorithms, a rate-based active queue management algorithm （RAQM）is proposed. The RAQM calculates the discarding probability upon the difference between the arriving data rate and the maximal service rate, and it is a simple algorithm which has only one parameter K. The stability criterion of the RAQM/TCP system is also analyzed with the aid of modem control theory. The simulation shows that RAQM can hold a very short and stable queue, which consequently shortens the end-to-end delay and jitter. Finally, the only parameter in the algorithm is also discussed.