A Study of Active Queue Management for Congestion Control (2000) [132 citations — 6 self]
Abstract:
In this work, we investigate mechanisms for Internet congestion control in general, and Random Early Detection (RED) in particular. We first study the current proposals for RED implementation and identify several structural problems such as producing large traffic oscillations and introducing unnecessary overhead in the fast path forwarding. We model RED as a feedback control system and we discover fundamental laws governing the traffic dynamics in TCP/IP networks. Based on this understanding, we derive a set of recommendations for the architecture and implementation of congestion control modules in routers, such as RED. I. INTRODUCTION Congestion control for IP networks has been a recurring problem for many years. The problem of congestion collapse encountered by early TCP/IP protocols has prompted the study of end-to-end congestion control algorithms in the late 80's and proposals such as [4], which forms the basis for the TCP congestion control in current implementations. The ess...
Citations
| 1738 | Random Early Detections Gateways for Congestion Avoidance – Floyd, Jacobson - 1993 |
| 867 | Modeling TCP Throughput: A Simple Model and its Empirical Validation – Padhye, Firoiu, et al. - 1998 |
| 415 | The macroscopic behavior of the TCP congestion avoidance algorithm – Mathis, Semke, et al. - 1997 |
| 340 | Dynamics of Random Early Detection – Lin, Morris - 1997 |
| 332 | TCP slow start, congestion avoidance, fast retransmit and fast recovery algorithms,” RFC – Stevens - 2001 |
| 119 | Shin A self-configuring RED gateway [A – Feng, Kandlur, et al. - 1999 |
| 43 | A stochastic model of TCP Reno congestion avoidance and control – Padhye, Firoiu, et al. - 1999 |
| 6 | ns-LBL Network Simulator – MCanne, Flyod - 1997 |
| 4 | Notes on RED in the end-to-end-interest mail list – Floyd - 1998 |

