Improving the start-up behavior of a congestion control scheme for TCP

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.

REFERENCES

• 1: Jong Suk Ahn , Peter B. Danzig , Zhen Liu , Limin Yan, Evaluation of TCP Vegas: emulation and experiment, Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, p.185-195, August 28-September 01, 1995, Cambridge, Massachusetts, United States
• 2: Lawrence S. Brakmo , Sean W. O'Malley , Larry L. Peterson, TCP Vegas: new techniques for congestion detection and avoidance, Proceedings of the conference on Communications architectures, protocols and applications, p.24-35, August 31-September 02, 1994, London, United Kingdom
• 3: Kevin Fall , Sally Floyd, Simulation-based comparisons of Tahoe, Reno and SACK TCP, ACM SIGCOMM Computer Communication Review, v.26 n.3, p.5-21, July 1996 [doi>10.1145/235160.235162]
• 4: S. Floyd. TCP and successive fast retransmits. ftp://ftp.ee.lbl.gov/papers/fastretrans.ps, October 1994.
• 5: Sally Floyd and Van Jacobson. On traffic phase effects in packet-switched gateways, ftp://ftp.ee.lbl/papers/phase.ps.Z.
• 6: A. Heybey. The network simulator. Technical report, MIT, September 1990.
• 7: J. C. Hoe. Start-up dynamics of TCP's congestion control and avoidance schemes, 1995.
• 8: V. Jacobson, Congestion avoidance and control, Symposium proceedings on Communications architectures and protocols, p.314-329, August 16-18, 1988, Stanford, California, United States
• 9: V. Jacobson. Modified TCP congestion avoidance algorithm, end2end-interest mailing list (Apr.), 1990.
• 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.
• 11: Srinivasan Keshav, A control-theoretic approach to flow control, Proceedings of the conference on Communications architecture & protocols, p.3-15, September 03-06, 1991, Zurich, Switzerland
• 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).
• 13: Matthew Mathis , Jamshid Mahdavi, Forward acknowledgement: refining TCP congestion control, Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, p.281-291, August 28-30, 1996, Palo Alto, California, United States
• 14: J. Postel. Transmission control protocol. Request for Comments 793, DDN Network Information Center, SRI International, September 1981.
• 15: Scott Schenker , Lixia Zhang , David D. Clark, Some observations on the dynamics of a congestion control algorithm, ACM SIGCOMM Computer Communication Review, v.20 n.5, p.30-39, Oct 1 1990 [doi>10.1145/381906.381931]
• 16: T. J. Shepard, TCP PACKET TRACE ANALYSIS, Massachusetts Institute of Technology, Cambridge, MA, 1991
• 17: W. R. Stevens. TCP/IP Illustrated, volume 1. Addison- Wesley Publishing Company, 1994.
• 18: W. Richard Stevens , Gary R. Wright, TCP/IP illustrated (vol. 2): the implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: TCP/IP

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Packet-switching networks; Network topology

General Terms:
Algorithms, Experimentation, Performance