Abstract
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 J. S. Ahn, P. B. Danzig, Z. Liu, and L. Yan. Evaluation of TCP Vegas: Emulation and experiment. In Proceedings of the A CM SIGCOMM '95, pages 185- 195, August 1995. Google ScholarDigital Library
- 2 L. S. Brakmo, S. W. O'Malley, and L. L. Peterson. TCP Vegas: New techniques for congestion detection and avoidance. In Proceedings of the A CM $IGCOMM '94{, pages 24-35, August 1994. ftp://ft p. cs. arizona, edu/xkernel/Papers / vegas, ps. Google ScholarDigital Library
- 3 K. Fall and S. Floyd. Simulation-based comparisons of tahoe, reno, and sack TCP. ftp://ftp.ee.lbl.gov/papers/sacks.ps.z, May 1996. Submitted to CCR, July 1996. Google ScholarDigital Library
- 4 S. Floyd. TCP and successive fast retransmits. ftp://ftp.ee.lbl.gov/papers/fastretrans.ps, October 1994.Google Scholar
- 5 Sally Floyd and Van Jacobson. On traffic phase effects in packet-switched gateways, ftp://ftp.ee.lbl/papers/phase.ps.Z.Google Scholar
- 6 A. Heybey. The network simulator. Technical report, MIT, September 1990.Google Scholar
- 7 J. C. Hoe. Start-up dynamics of TCP's congestion control and avoidance schemes, 1995.Google Scholar
- 8 V. Jacobson. Congestion avoidance and control. In Proceedings of the A CM SIGCOMM '88, pages 314- 329, August 1988. Google ScholarDigital Library
- 9 V. Jacobson. Modified TCP congestion avoidance algorithm, end2end-interest mailing list (Apr.), 1990.Google Scholar
- 10 Van Jacobson. Berkeley TCP evolution from 4.3-tahoe to 4.3-reno. In Proceedings of the Eighteenth Internet Engineering Task Force, page 365, 1990.Google Scholar
- 11 S. Keshav. A control-theoretic approach to flow control. In Proceedings of the A CM SIGCOMM '91, pages 3-15, September 1991. Google ScholarDigital Library
- 12 M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP selective acknowledgment options, ftp://ftp.ietf, cnri.reston.va.us/internetdrafts/draft-ietf-tcplw-sack-00.txt, April 1996. (Internet Draft, work in progress). Google ScholarDigital Library
- 13 M. Mathis and Jamshid Mahdavi. Forward acknowledgment: Refining TCP congestion control. In Proceedings of the A CM SIGCOMM '88, August 1996. To appear. Google ScholarDigital Library
- 14 J. Postel. Transmission control protocol. Request for Comments 793, DDN Network Information Center, SRI International, September 1981.Google Scholar
- 15 S. Shenker and L. Zhang. Some observations on the dynamics of a congestion control algorithm. ACM Computer Communication Review, 20:30-39, October 1990. Google ScholarDigital Library
- 16 T. Shepard. TCP packet trace analysis. Technical Report 494, MIT Laboratory for Computer Science, February 1991. Google ScholarDigital Library
- 17 W. R. Stevens. TCP/IP Illustrated, volume 1. Addison- Wesley Publishing Company, 1994.Google Scholar
- 18 G. R. Wright and W. R. Stevens. TCP/IP Illustrated, volume 2. Addison-Wesley Publishing Company, 1995. Google ScholarDigital Library
Index Terms
- Improving the start-up behavior of a congestion control scheme for TCP
Recommendations
Improving the start-up behavior of a congestion control scheme for TCP
SIGCOMM '96: Conference proceedings on Applications, technologies, architectures, and protocols for computer communicationsBased 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, ...
An agent based congestion control and notification scheme for TCP over ABR
We overview in this paper the enhancement of TCP's congestion control mechanisms using Explicit Congestion Notification (ECN) over ATM networks. Congestion is indicated by not only packet losses as is currently the case but an agent implemented at the ...
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Comments