Improving TCP startup performance using active measurements: algorithm and evaluation

Abstract

TCP slow start exponentially increases the congestion window size to detect the proper congestion window for a network path. This often results in significant packet loss, while breaking off slow start using a limited slow start threshold may lead to an overly conservative congestion window size. This problem is especially severe in high speed networks. In this paper we present a new TCP startup algorithm, called paced start, that incorporates an available bandwidth probing technique into the TCP startup algorithm. Paced start is based on the observation that when we view the TCP startup sequence as a sequence of packet trains, the difference between the data packet spacing and the acknowledgement spacing can yield valuable information about the available bandwidth. Slow start ignores this information, while paced start uses it to quickly estimate the proper congestion window for the path. For most flows. Paced Start transitions into congestion avoidance mode faster than Slow Start, has a significantly lower packet loss rate, and avoids the timeout that is often associated with slow start. This paper describes the paced start algorithm and uses simulation and real system experiments to characterize its properties.