A spectrum of TCP-friendly window-based congestion control algorithms

摘要

The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. This paper presents a comprehensive study of a new spectrum of window-based congestion controls, which are TCP-friendly as well as TCP-compatible under RED. Our controls utilize history information in their control rules, and by doing so, they improve the transient behavior. We demonstrate analytically, and through extensive ns simulations, the steady-state and transient behavior of several instances of this new spectrum.