A New Scheme for TCP Congestion Control: Smooth Start and Dynamic Recovery

H. Wang and C. L. Williamson. Proceedings of the Sixth International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'98), Montreal, PQ, pp. 69-76, July 1998.

Abstract: This paper presents a new approach to TCP congestion control. The new scheme includes two parts: (1) the Smooth-Start algorithm, which replaces the Slow-Start algorithm at the start of a TCP connection or after a retransmission timeout, and (2) the Dynamic Recovery algorithm, which replaces the Fast Recovery algorithm to recover packet losses when a TCP connection is congested. Both algorithms require modifications only to the sender side of the TCP implementation.

Simulation is used to evaluate the performance of the algorithms. The simulation experiments are conducted using the ns simulator, to facilitate comparisons with Tahoe, Reno, New-Reno, SACK, and FACK TCP. The simulation results show that the new scheme performs at least as well as SACK and FACK TCP, which in turn consistently outperform TCP Tahoe and Reno. Furthermore, the implementation of the new scheme is simpler than that of SACK and FACK.