Limit behavior of ECN/RED gateways under a large number of TCP flows

A stochastic model of an ECN/RED gateway with competing TCP sources sharing the capacity is considered. As the number of competing flows becomes large, the queue behavior at the gateway can be described by a two-dimensional recursion and the throughput behavior of individual TCP flows becomes asymptotically independent. The steady-state regime of the limiting behavior can be calculated from a well-known TCP throughput model with fixed loss probability. In addition, a central limit theorem is presented, yielding insight into the relationship between the queue fluctuation and the marking probability function. We confirm the results by simulations and discuss their implications for network dimensioning.

[1]  Eitan Altman,et al.  TCP in presence of bursty losses , 2000, SIGMETRICS '00.

[2]  A. Shwartz,et al.  Stochastic approximations for finite-state Markov chains , 1990 .

[3]  Jitendra Padhye,et al.  A Stochastic Model of TCP Reno Congestion Avoidence and Control , 1999 .

[4]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[5]  Ahmed Mokhtar,et al.  Stochastic modeling of random early detection gateways in TCP networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

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

[7]  Donald F. Towsley,et al.  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS '01.

[8]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[9]  Armand M. Makowski,et al.  TCP Traffic Modeling via Limit Theorems , 2002 .

[10]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

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

[12]  François Baccelli,et al.  A mean-field model for multiple TCP connections through a buffer implementing RED , 2002, Perform. Evaluation.

[13]  Alhussein A. Abouzeid,et al.  Analytic understanding of RED gateways with multiple competing TCP flows , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[14]  Dohy Hong,et al.  Many TCP User Asymptotic Analysis of the AIMD Model , 2001 .

[15]  Vishal Misray,et al.  Stochastic Differential Equation Modeling and Analysis of TCP-Windowsize Behavior , 2005 .

[16]  Richard J. La,et al.  Characterization of General TCP Traffic under a Large Number of Flows Regime , 2002 .

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

[18]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[19]  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.

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