A new scheme for TCP congestion control: smooth-start and dynamicrecovery

摘要

This paper presents a new approach to TCP congestion control. Thennew scheme includes two parts: (I) the smooth-start algorithm, whichnreplaces the slow-start algorithm at the start of a TCP connection ornafter a retransmission timeout, and (2) the dynamic recovery algorithm,nwhich replaces the fast recovery algorithm to recover packet losses whenna TCP connection is congested. Both algorithms require modificationsnonly to the sender side of the TCP implementation. Simulation is used tonevaluate the performance of the algorithms. The simulation experimentsnare conducted using the ns simulator to facilitate comparisons withnTahoe, Reno, New-Reno, SACK, and FACK TCP. The simulation results shownthat the new scheme performs at least as well as SACK and FACK TCP,nwhich in turn consistently outperform TCP Tahoe and Reno. Furthermore,nthe implementation of the new scheme is simpler than that of SACK andnFACK