The Research of Adaptive Network Congestion Control Algorithm Based on AQM

Congestion control has been emphasis of network research. The researchers proposed some algorithm of congestion control in order to continuously reduce the packet dropping possibility, and improve the link utilization ratio. First the paper directed the user by comparing some typical AQM control algorithms, enabled them optimize the network transport performance using more reasonable control algorithm in different network environment. Finally the paper proposed a new congestion control algorithm,which by predicting the instantaneous queue length of next time to decide congestion. It can find the congestion at the earliest time and make the best of network resource. The simulation result shows the proposal can detect the congestion in time in the changing network condition, and make the output smooth.

[1]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[2]  Kevin Jeffay,et al.  The effects of active queue management on web performance , 2003, SIGCOMM '03.

[3]  Aleksandar Kuzmanovic,et al.  The power of explicit congestion notification , 2005, SIGCOMM '05.

[4]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

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

[6]  Long Le,et al.  The Effects of Active Queue Management and Explicit Congestion Notification on Web Performance , 2007, IEEE/ACM Transactions on Networking.

[7]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

[8]  Lakshminarayanan Subramanian,et al.  One more bit is enough , 2005, SIGCOMM '05.

[9]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).