Active Queue Management for Flow Fairness and Stable Queue Length

Two major goals of queue management are flow fairness and queue-length stability However, most prior works dealt with these goals independently. In this paper, we show that both goals can be effectively achieved at the same time. We propose a novel scheme that realizes flow fairness and queue-length stability. In the proposed scheme, high-bandwidth flows are identified via a multilevel caching technique. Then, we calculate the base drop probability for resolving congestion with a stable queue, and apply it to individual flows differently depending on their sending rates. Via extensive simulations, we show that the proposed scheme effectively realizes flow fairness between unresponsive and TCP flows, and among heterogeneous TCP flows, while maintaining a stable queue.

[1]  P. McKenney.  Stochastic Fairness Queuing , 1991 .

[2]  Ao Tang,et al.  Understanding CHOKe , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[5]  Fang Hao,et al.  Fast, memory-efficient traffic estimation by coincidence counting , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Kang G. Shin,et al.  Stochastic fair blue: a queue management algorithm for enforcing fairness , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[8]  Jong-Hwan Kim,et al.  Reducing Queue Oscillation at a Congested Link , 2008, IEEE Transactions on Parallel and Distributed Systems.

[9]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[10]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[11]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[12]  Murali S. Kodialam,et al.  Runs based traffic estimator (RATE): a simple, memory efficient scheme for per-flow rate estimation , 2004, IEEE INFOCOM 2004.

[13]  Analysis and Simulation of a Fair Queuing Algorithm , 2008 .

[14]  T. V. Lakshman,et al.  SRED: stabilized RED , 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).

[15]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[16]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[17]  Steven H. Low,et al.  REM: active queue management , 2001, IEEE Netw..

[18]  George Varghese,et al.  New directions in traffic measurement and accounting , 2002, CCRV.

[19]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[20]  Fang Hao,et al.  ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation , 2004, SIGMETRICS '04/Performance '04.

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

[22]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

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

[24]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[25]  R. Jain.  Throughput fairness index : An explanation , 1999 .

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

[27]  Yin Zhang,et al.  On the characteristics and origins of internet flow rates , 2002, SIGCOMM '02.

[28]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).