REM: active queue management

We describe a new active queue management scheme, random exponential marking (REM), that aims to achieve both high utilization and negligible loss and delay in a simple and scalable manner. The key idea is to decouple the congestion measure from the performance measure such as loss, queue length, or delay. While the congestion measure indicates excess demand for bandwidth and must track the number of users, the performance measure should be stabilized around their targets independent of the number of users. We explain the design rationale behind REM and present simulation results of its performance in wireline and wireless networks.

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

[2]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[4]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

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

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

[7]  Steven H. Low,et al.  Understanding TCP Vegas: a duality model , 2002 .

[8]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  S. Low,et al.  Understanding Vegas: a duality model , 2002 .

[10]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

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

[12]  Frank Kelly,et al.  Mathematical modeling of the Internet , 1999 .

[13]  F. Paganini.  On the stability of optimization-based flow control , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[14]  F. Kelly.  Charging and Rate Control for Elastic Traac , 1997 .

[15]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[16]  T. V. Lakshman,et al.  TCP over wireless with link level error control: analysis and design methodology , 1999, TNET.

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

[18]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[19]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[20]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .