Design of Customer-based AQM Routers to Achieve Fair Inter-server Bandwidth Allocation

There were more than 50 new AQM algorithms which have been proposed since 1999. All of these approaches are designed on per-flow basis. Ideally, long-lived responsive flows will get their fair shares of bandwidth under the congestion control of a well designed AQM. However, responsive flows may sent by a unresponsive server. This will introduce so-called inter-server fairness problem, and will also make ISP price-based services policy enforcement difficult. We study the inter-server fairness problem, and propose a simple and deployable server-based AQM approach, in which grouping techniques is used to reduce the states needed to keep. This approach can provide fair services to different servers without affecting congestion control performance in terms of packet loss rate and queue stability. We prove the effectiveness of our approach with extensive simulations using ns-2 simulator

[1]  T. V. Lakshman,et al.  The performance of TCP/IP for networks with high bandwidth-delay products and random loss , 1997, TNET.

[2]  Moshe Zukerman,et al.  GREEN: an active queue management algorithm for a self managed Internet , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[3]  Guillaume Urvoy-Keller,et al.  Size-based scheduling to improve the performance of short TCP flows , 2005, IEEE Network.

[4]  Kang G. Shin,et al.  The BLUE active queue management algorithms , 2002, TNET.

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

[6]  Sonia Fahmy,et al.  Comparison of load-based and queue-based active queue management algorithms , 2002, SPIE ITCom.

[7]  T. V. Lakshman,et al.  Design considerations for supporting TCP with per-flow queueing , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[9]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[10]  Steven H. Low,et al.  An enhanced random early marking algorithm for Internet flow control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  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).

[12]  James Aweya,et al.  A control theoretic approach to active queue management , 2001, Comput. Networks.

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

[14]  R. Srikant,et al.  An adaptive virtual queue (AVQ) algorithm for active queue management , 2004, IEEE/ACM Transactions on Networking.

[15]  Donald F. Towsley,et al.  Analysis and design of controllers for AQM routers supporting TCP flows , 2002, IEEE Trans. Autom. Control..