Performance Improvement of Adaptive AQM Using the Variation of Queue Length

AQM (active queue management) starts dropping packets earlier to notify traffic sources about the incipient stages of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (queue variation adaptive RED) algorithm which is based on the variation of a queue per hour, and it can be responded to bursty traffic more actively. It is possible to provide more smoothness of average queue length by the method that considered the variation of current queue compared to RED and ARED. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This result in shorter end-to-end delays by the lower number of packet retransmits. QVARED reduces a bias effect over 18% than that of drop-tail method, therefore packets are transmitted stably with respect to bursty traffic

[1]  Mahbub Hassan,et al.  High Performance TCP/IP Networking , 2003 .

[2]  Kang G. Shin,et al.  A self-configuring RED gateway , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Sally Floyd,et al.  Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management , 2001 .

[4]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[5]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[6]  Victor Firoiu,et al.  A study of active queue management for congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).