Common problems in delay‐based congestion control algorithms: a gallery of solutions

Abstract

SUMMARYAlthough delay-based congestion control protocols such as FAST promise to deliver better performance than traditional TCP Reno, they have not yet been widely incorporated to the Internet. Several factors have contributed to their lack of deployment. Probably, the main contributing factor is that they are not able to compete fairly against loss-based congestion control protocols. In fact, the transmission rate in equilibrium of delay-based approaches is always less than their fair share when they share the network with traditional TCP-Reno derivatives, that employ packet losses as their congestion signal. There are also other performance impairments caused by the sensitivity to errors in the measurement of the congestion signal (queuing delay) that reduce the efficiency and the intra-protocol fairness of the algorithms. In this paper we report, analyze and discuss some recent proposals in the literature to improve the dynamic behavior of delaybased congestion control algorithms, and FAST in particular. Coexistence of sources reacting differently to congestion, identifying congestion appearance in the reverse path and the persistent congestion problem are the issues specifically addressed.

Less-than-Best-Effort Service: A Survey of End-to-End Approaches

“…The accuracy of delay-based congestion predictors has been the subject of a good deal of research, see for instance [62]- [67]. The main result of most of these studies is that delays (or, more precisely, round-trip times) are, in general, weakly correlated with congestion.…”

Delay Bound: Fractal Traffic Passes through Network Servers

“…Remark 16. The bandwidth regarding ( ) expressed by (34) may be generally less than that expressed by (21).…”

“…Recall that the time constraint mentioned above is the message delay suffering from S from A to B (Sandmann [20], Rodríguez-Pérez et al [21], Anjum et al [22], Papastergiou et al [23], Panshenskov and Vakhitov [24], Kumar et al [25], Ferrandiz et al [26], Pin et al [27], Florens et al [28], Lenzini et al [29], and Tu et al [30]). More precisely, in the case of the Internet, this term specifically means the delay of data packets.…”

Active queue management with discrete sliding modes in TCP networks

“…SACK [3], TCP NewReno [4], or use -different from the packet loss -indicators of congestion, e.g. round-trip time (RTT) measurements in TCP Vegas [5] and other delay-based control schemes [6]. The second category encompasses active queue management (AQM) solutions, which provide network assisted congestion control.…”