Kevin Fall
Sally Floyd
Abstract
This paper uses simulations to explore the benefits of adding selective acknowledgments (SACK) and selective repeat to TCP. We compare Tahoe and Reno TCP, the two most common reference implementations for TCP, with two modified versions of Reno TCP. The first version is New-Reno TCP, a modified version of TCP without SACK that avoids some of Reno TCP's performance problems when multiple packets are dropped from a window of data. The second version is SACK TCP, a conservative extension of Reno TCP modified to use the SACK option being proposed in the Internet Engineering Task Force (IETF). We describe the congestion control algorithms in our simulated implementation of SACK TCP and show that while selective acknowledgments are not required to solve Reno TCP's performance problems when multiple packets are dropped, the absence of selective acknowledgments does impose limits to TCP's ultimate performance. In particular, we show that without selective acknowledgments, TCP implementations are constrained to either retransmit at most one dropped packet per round-trip time, or to retransmit packets that might have already been successfully delivered.
- {BBJ92} D. Borman, R. Braden, and V. Jacobson. "TCP Extensions for High Performance,". Request for Comments (Proposed Standard) RFC 1323, Internet Engineering Task Force, May 1992. (Obsoletes RFC1185).Google Scholar
- {BJ88} R. Braden and V. Jacobson. "TCP extensions for long-delay paths,". Request for Comments (Experimental) RFC 1072, Internet Engineering Task Force, October 1988.Google Scholar
- {BJZ90} R. Braden, V. Jacobson, and L. Zhang. "TCP Extension for High-Speed Paths,". Request for Comments (Experimental) RFC 1185, Internet Engineering Task Force, October 1990. (Obsoleted by RFC1323).Google Scholar
- {BPSK96} H. Balakrishnan, V.N. Padmanabhan, S. Seshan, and R.H. Katz. "A Comparison of Mechanisms for Improving TCP Performance over Wireless Links,". SIGCOMM Symposium on Communications Architectures and Protocols, Aug. 1996. to appear. Google ScholarDigital Library
- {Bra94} R. Braden. "T/TCP - TCP Extensions for Transactions Functional Specification,". Request for Comments (Experimental) RFC 1644, Internet Engineering Task Force, July 1994.Google Scholar
- {CH95} D.D. Clark and J. Hoe. "Start-up Dynamics of TCP's Congestion Control and Avoidance Schemes,". Technical report, Jun. 1995. Presentation to the Internet End-to-End Research Group, cited for acknowledgement purposes only.Google Scholar
- {Che88} D. Cheriton. "VMTP: Versatile Message Transaction Protocol: Protocol specification,". Request for Comments (Experimental) RFC 1045, Internet Engineering Task Force, February 1988.Google Scholar
- {CLZ87} D. Clark, M. Lambert, and L. Zhang. "NETBLT: A bulk data transfer protocol,". Request for Comments (Experimental) RFC 998, Internet Engineering Task Force, March 1987. (Obsoletes RFC0969).Google Scholar
- {FJ93} Sally Floyd and Van Jacobson. "Random Early Detection Gateways for Congestion Avoidance,". IEEE/ACM Transactions on Networking, 1(4):397-413, Aug. 1993. URL http://www-nrg.ee.lbl.gov/nrgpapers. html. Google ScholarDigital Library
- {Flo95} Sally Floyd. "Simulator Tests". Technical report, Jul. 1995. URL http://www-nrg.ee.lbl.gov/nrg-papers.html.Google Scholar
- {Flo96a} S. Floyd. "Issues of TCP with SACK,". Technical report, Mar. 1996. URL ftp://ftp.ee.lbl.gov/papers/issues_sa.ps.Z.Google Scholar
- {Flo96b} S. Floyd. "SACK TCP: The sender's congestion control algorithms for the implementation "sack1" in LBNL's "ns" simulator (viewgraphs).,". Technical report, Mar. 1996. Presentation to the TCP Large Windows Working Group of the IETF, March 7, 1996. URL ftp://ftp.ee.lbl.gov/talks/sacks.ps.Google Scholar
- {Hoe95} J. Hoe. "Start-up Dynamics of TCP's Congestion Control and Avoidance Schemes,". Jun. 1995. Master's thesis, MIT.Google Scholar
- {Hoe96} J. Hoe. "Improving the Start-up Behavior of a Congestion Control Scheme for TCP,". SIGCOMM Symposium on Communications Architectures and Protocols, Aug. 1996. to appear. Google ScholarDigital Library
- {HSV84} R. Hinden, J. Sax, and D. Velten. "Reliable Data Protocol,". Request for Comments (Experimental) RFC 908, Internet Engineering Task Force, July 1984. (Updated by RFC1151).Google Scholar
- {Jac88} V. Jacobson. "Congestion Avoidance and Control,". SIGCOMM Symposium on Communications Architectures and Protocols, pages 314-329, 1988. An updated version is available via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z. Google ScholarDigital Library
- {Jac90} V. Jacobson. "Modified TCP Congestion Avoidance Algorithm,". Technical report, 30 Apr. 1990. Email to the end2end-interest Mailing List, URL ftp://ftp.ee.lbl.gov/email/vanj.90apr30.txt.Google Scholar
- {Kes88} S. Keshav. "REAL: a Network Simulator,". Technical Report 88/472, University of California Berkeley, Berkeley, California, 1988. Google ScholarDigital Library
- {Kes94} S. Keshav. "Packet-Pair Flow Control,". Technical report, Nov. 1994. Presentation to the Internet End-to-End Research Group, cited for acknowledgement purposes only.Google Scholar
- {MF95} Steven McCanne and Sally Floyd. "NS (Network Simulator),". 1995. URL http://www-nrg.ee.lbl.gov/ns.Google Scholar
- {MM96} Matthew Mathis and Jamshid Mahdavi. "Forward Acknowledgement: Refining TCP Congestion Control,". SIGCOMM Symposium on Communications Architectures and Protocols, Aug. 1996. to appear. Google ScholarDigital Library
- {MMFR96} Matthew Mathis, Jamshid Mahdavi, Sally Floyd, and Allyn Romanow. "TCP Selective Acknowledgment Options,". (Internet draft, work in progress), 1996.Google Scholar
- {SDW92} W. T. Strayer, B. Dempsey, and A. Weaver. XTP: The Xpress Transfer Protocol. Addison Wesley, Reading, MA, 1992. Google ScholarDigital Library
- {Ste94} W. Richard Stevens. TCP/IP Illustrated, Volume I: The Protocols. Addison Wesley, 1994.Google ScholarDigital Library
Index Terms
- Simulation-based comparisons of Tahoe, Reno and SACK TCP
Recommendations
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to ...
A simulation-based performance evaluation of Tahoe, Reno and Sack TCP as appropriate transport protocols for SIP
The Session Initiation Protocol currently supports the use of both the Transmission Control Protocol and the User Datagram Protocol as transport protocols. Proponents of the SIP protocol have cited this characteristic as a laudable consequence of the ...
Reno Friendly TCP Westwood based on Router Buffer Estimation
ICAS-ICNS '05: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and ServicesTCP Reno versions are widely used in current network, however it has been actualized that their throughput deteriorates in high-speed network and wireless environments. To overcome these problems of TCP Reno versions, a number of protocols have been ...
Comments