几种主动式队列管理算法的比较研究

主动式队列管理(Active Queue Management,AQM)技术是IETF为了解决Internet拥塞控制问题而提出的一种路由器缓存管理技术.本文对几种主要AQM算法RED、BLUE、ARED和SRED的性能在基于ns-2仿真实验的基础上进行了比较研究.研究的性能包括队列长度、丢包概率、丢包率、连接数对吞吐量的影响及缓冲区大小对链路利用率的影响等.仿真结果表明BLUE、ARED和SRED在这几方面的性能都要优于RED算法.

A Research on Some Acitve Queue Management Algorithms

To address the problem of TCP end-to-end congestion control,IETF advocates deploying active queue management (AQM) mechanisms in the TCP/IP networks.Several popular AQM algorithms,such as RED (Random Early Detection),BLUE,ARED (Adaptive RED) and SRED (Stabilized RED),are compared based on simulations and the performance metrics used in the study are queue size,packet drop probability,packet loss rate,throughput on different connections and link utilization on different buffer size.The simulation results indicate that in all these aspects,the performance of BLUE,ARED and SRED are better than that of RED.Furthermore,ARED and SRED can stabilize queue size and control packet loss rate effectively thus they maintain high link utilization,bounded delays and more certain buffer provision.