Simulation analysis of RED with short lived TCP connections

Several objectives have been identified in developing the random early drop (RED): decreasing queueing delay, increasing throughput, and increasing fairness between short and long lived connections. It has been believed that indeed the drop probability of a packet in RED does not depend on the size of the file to which it belongs. In this paper we study the fairness properties of RED where fairness is taken with respect to the size of the transferred file. We focus on short lived TCP sessions. Our findings are that (i) in terms of loss probabilities, RED is unfair: it favors short sessions, (ii) RED is fairer in terms of the average throughput of a session (as a function of its size) than in terms of loss probabilities. We study various loading regimes, with various versions of RED.

[1]  A. Arvidsson,et al.  On traffic models for TCP/IP , 1999 .

[2]  Pirkko Kuusela,et al.  Modeling RED with Idealized TCP Sources , 2001 .

[3]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[4]  J. Turner,et al.  Queue management for short-lived TCP flows in backbone routers , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[6]  Hiroyuki Ohsaki,et al.  Steady State Analysis of the RED Gateway: Stability, Transient Behavior, and Parameter Setting , 2002 .

[7]  Anja Feldmann,et al.  TCP/IP traffic dynamics and network performance: a lesson in workload modeling, flow control, and trace-driven simulations , 2001, CCRV.

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

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

[10]  Armand M. Makowski,et al.  Queue dynamics of RED gateways under large number of TCP flows , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[11]  Serge Fdida,et al.  A Quantitative Model for the Parameter Setting of RED with TCP Traffic , 2001, IWQoS.

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

[13]  Vinod Sharma,et al.  Performance analysis of TCP connections with RED control and exogenous traffic , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[15]  Fernando Paganini,et al.  Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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