Based on experiments conducted in a network simulator and over real networks, this paper proposes changes to the congestion control scheme in current TCP implementations to improve its behavior during the start-up period of a TCP connection.The scheme, which includes Slow-start, Fast Retransmit, and Fast Recovery algorithms, uses acknowledgments from a receiver to dynamically calculate reasonable operating values for a sender's TCP parameters governing when and how much a sender can pump into the network. During the start-up period, because a TCP sender starts with default parameters, it often ends up sending too many packets and too fast, leading to multiple losses of packets from the same window. This paper shows that recovery from losses during this start-up period is often unnecessarily time-consuming.In particular, using the current Fast Retransmit algorithm, when multiple packets in the same window are lost, only one of the packet losses may be recovered by each Fast Retransmit; the rest are often recovered by Slow-start after a usually lengthy retransmission timeout. Thus, this paper proposes changes to the Fast Retransmit algorithm so that it can quickly recover from multiple packet losses without waiting unnecessarily for the timeout. These changes, tested in the simulator and on the real networks, show significant performance improvements, especially for short TCP transfers. The paper also proposes other changes to help minimize the number of packets lost during the start-up period.
[1]
Sally Floyd,et al.
TCP Selective Acknowledgement Options
,
1996
.
[2]
Matthew Mathis,et al.
Forward acknowledgement: refining TCP congestion control
,
1996,
SIGCOMM '96.
[3]
Sally Floyd,et al.
Simulation-based comparisons of Tahoe, Reno and SACK TCP
,
1996,
CCRV.
[4]
Sally Floyd,et al.
TCP Selective Acknowledgment Options
,
1996,
RFC.
[5]
Zhen Liu,et al.
Evaluation of TCP Vegas: emulation and experiment
,
1995,
SIGCOMM '95.
[6]
W. Richard Stevens,et al.
TCP/IP Illustrated, Volume 2: The Implementation
,
1995
.
[7]
V. Jacobson.
Congestion avoidance and control
,
1988,
CCRV.
[8]
Janey C. Hoe,et al.
Start-up dynamics of TCP's congestion control and avoidance schemes
,
1995
.
[9]
Sally Floyd,et al.
TCP and Successive Fast Retransmits
,
1995
.
[10]
L. Peterson,et al.
TCP Vegas: new techniques for congestion detection and avoidance
,
1994,
SIGCOMM.
[11]
Srinivasan Keshav,et al.
A control-theoretic approach to flow control
,
1991,
SIGCOMM '91.
[12]
Van Jacobson,et al.
Traffic phase effects in packet-switched gateways
,
1991,
CCRV.
[13]
T. J. Shepard,et al.
TCP PACKET TRACE ANALYSIS
,
1991
.
[14]
Scott Shenker,et al.
Some observations on the dynamics of a congestion control algorithm
,
1990,
CCRV.