Analytic understanding of RED gateways with multiple competing TCP flows

An analytical framework for multiple TCP flows sharing a bottleneck link under the random early detection (RED) regime is developed. Closed form expressions for the steady state throughput and average queueing delay are derived and verified by simulations; these show that RED significantly improves the inherent TCP bias against links with higher round-trip delays as compared to tail drop, contrary to prevailing belief. Further, we derive closed form bounds on the minimum average queuing delay achievable through a RED gateway with no deterministic packet drop.

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

[2]  Patrick Brown,et al.  Resource sharing of TCP connections with different round trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  A. Mokhtar,et al.  A random early discard framework for congestion control in ATM networks , 1999, IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462).

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

[5]  Kang G. Shin,et al.  Techniques for Eliminating Packet Loss in Congested TCP/IP Networks , 1997 .

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

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

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

[9]  Eman Salaheddin Hashem,et al.  Analysis of Random Drop for Gateway Congestion Control , 1989 .

[10]  Serap A. Savari,et al.  The behavior of certain stochastic processes arising in window protocols , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[11]  F. Kelly Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[12]  Jean-Chrysotome Bolot End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM 1993.

[13]  Alhussein A. Abouzeid,et al.  Stochastic modeling of TCP over lossy links , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[14]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .

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

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

[17]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[18]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

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

[20]  B. Barden Recommendations on queue management and congestion avoidance in the Internet , 1998 .

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

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

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

[24]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.