Mark Allman
Vern Paxson
ABSTRACT
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of network properties based on measurements performed by the connection endpoints. We consider two basic transport estimation problems: determining the setting of the retransmission timer (RTO) for a reliable protocol, and estimating the bandwidth available to a connection as it begins. We look at both of these problems in the context of TCP, using a large TCP measurement set [Pax97b] for trace-driven simulations. For RTO estimation, we evaluate a number of different algorithms, finding that the performance of the estimators is dominated by their minimum values, and to a lesser extent, the timer granularity, while being virtually unaffected by how often round-trip time measurements are made or the settings of the parameters in the exponentially-weighted moving average estimators commonly used. For bandwidth estimation, we explore techniques previously sketched in the literature [Hoe96, AD98] and find that in practice they perform less well than anticipated. We then develop a receiver-side algorithm that performs significantly better.
- AD98.Mohit Aron and Peter Druschel. TCP: Improving Startup Dynamics by Adaptive Timers and Congestion Control. Technical Report TR98-318, Rice University Computer Science, 1998.]]Google Scholar
- AFP98.Mark Allman, Sally Floyd, and Craig Partridge. Increasing TCP's Initial Window, September 1998. RFC 2414.]] Google ScholarDigital Library
- APS99.Mark Allman, Vern Paxson, and W. Richard Stevens. TCP Congestion Control, April 1999. RFC 2581.]]Google Scholar
- BCC+98.Robert Braden, David Clark, Jon Crowcroft, Bruce Davie, Steve Deering, Deborah Estrin, Sally Floyd, Van Jacobson, Greg Minshall, Craig Partridge, Larry Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, and Lixia Zhang. Recommendations on Queue Management and Congestion Avoidance in the Intemet, April 1998. RFC 2309.]] Google ScholarDigital Library
- Bra89.Robert Braden. Requirements for Internet Hosts- Communication Layers, October 1989. RFC 1122.]] Google ScholarDigital Library
- DDK+90.Wi!libald Doeringer, Doug Dykeman, Matthias Kaiserswerth, Bernd Werner Meister, Harry Rudin, and Robin Williamson. A Survey of Light-Weight Transport Protocols for High-Speed Networks. IEEE Transactions on Communications, 38(11):2025-2039, November 1990.]]Google Scholar
- FF96.Kevin Fall and Sally Floyd. Simulation-based Compax/sons of Tahoe, Reno, and SACK TCP. Computer Communications Review, 26(3), July 1996.]] Google ScholarDigital Library
- FH99.Sally Floyd and Tom Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm, April 1999. RFC 2582.]] Google ScholarDigital Library
- FJ93.Sally Floyd and Van Jacobson. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking, 1(4):397-413, August 1993.]] Google ScholarDigital Library
- Hoe96.Janey Hoe. Improving the Start-up Behavior of a Congestion Control Scheme for TCP. In ACM SIGCOMM, August 1996.]] Google ScholarDigital Library
- Jac88.Van Jacobson. Congestion Avoidance and Control. In ACM SIGCOMM, 1988.]] Google ScholarDigital Library
- Jac90.Van Jacobson. Modified TCP Congestion Avoidance Algorithm, April 1990. Email to the end2end-interest mailing list. URL: ftp://ftp.ee, lbl.gov/email/ vanj.90apr30, txt.]]Google Scholar
- JBB92.Van Jacobson, Robert Braden, and David Borman. TCP Extensions for High Performance, May 1992. RFC 1323.]] Google ScholarDigital Library
- JK92.Van Jacobson and Michael Karels. Congestion Avoidance and Control, 1992. ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.]]Google Scholar
- Kes91.Srinivasan Keshav. A Control Theoretic Approach to Flow Control. In ACM SIGCOMM, pages 3-15, September 1991.]] Google ScholarDigital Library
- KP87.Phil Kam and Craig Partridge. Improving Round-Trip Time Estimates in Reliable Transport Protocols. In ACM SIGCOMM, pages 2-7, August 1987.]] Google ScholarDigital Library
- Lud99.Reiner Ludwig. A Case for Flow-Adaptive Wireless Links. Technical report, Ericsson Research, February 1999.]] Google ScholarDigital Library
- Mil83.David Mills. Internet Delay Experiments, December 1983. RFC 889.]] Google ScholarDigital Library
- MM96.Matt Mathis and Jamshid Mahdavi. Forward Acknowledgment: Refining TCP Congestion Control. In ACM SIGCOMM, August 1996.]] Google ScholarDigital Library
- MMFR96.Matt Mathis, Jamshid Mahdavi, Sally Floyd, and Allyn Romanow. TCP Selective Acknowledgement Options, October 1996. RFC 2018.]] Google ScholarDigital Library
- Mog92.Jeffrey C. Mogul. Observing TCP Dynamics in Real Networks. In ACM SIGCOMM, pages 305-317, 1992.]] Google ScholarDigital Library
- MSMO97.Matt Mathis, Jeff Semke, Jamshid Mahdavi, and Teunis Ott. The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. Computer Communication Review, 27(3), July 1997.]] Google ScholarDigital Library
- Nag84.John Nagle. Congestion Control in IP/TCP Intemetworks, January 1984. RFC 896.]] Google ScholarDigital Library
- PAD+99.Vern Paxson, Mark Allman, Scott Dawson, William Fenner, Jim Griner, Ian Heavens, Kevin Lahey, Jeff Semke, and Bernie Volz. Known TCP Implementation Problems, March 1999. RFC 2525.]] Google ScholarDigital Library
- Pax97a.Vern Paxson. Automated Packet Trace Analysis of TCP Implementations. In A CM SIGCOMM, September 1997.]] Google ScholarDigital Library
- Pax97b.Vern Paxson. End-to-End Internet Packet Dynamics. In A CM SIGCOMM, September 1997.]] Google ScholarDigital Library
- Pax97c.Vern Paxson. Measurements and Analysis of End-to- End lnternet Dynamics. Ph.D. thesis, University of California Berkeley, 1997.]] Google ScholarDigital Library
- Pax98.Vern Paxson. On Calibrating Measurements of Packet Transit Times. In ACM SIGMETRICS, June 1998.]] Google ScholarDigital Library
- Pos81.Jon Postel. Transmission Control Protocol, September 198 I. RFC 793.]]Google Scholar
- Ste97.W. Richard Stevens. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, January 1997. RFC 2001.]] Google ScholarDigital Library
- TMW97.Kevin Thompson, Gregory Miller, and Rick Wilder. Wide-Area Intemet Traffic Patterns and Characteristics. IEEE Network, 11 (6): 10-23, November/December 1997.]]Google Scholar
- WS95.Gary R. Wright and W. Richard Stevens. TCP/IP Illustrated Volume 11: The hnplementation. Addison- Wesley, 1995.]] Google ScholarDigital Library
- Zha86.Lixia Zhang. Why TCP Timers Don't Work Well. In A CM SIGCOMM, pages 397--405, August 1986.]] Google ScholarDigital Library
- ZSC91.Lixia Zhang, Scott Shenker, and David Clark. Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two- Way Traffic. In ACM SIGCOMM, September 1991.]] Google ScholarDigital Library
Index Terms
- On estimating end-to-end network path properties
Recommendations
On estimating end-to-end network path properties
The more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of ...
On estimating end-to-end network path properties
SIGCOMM LA '01: Workshop on Data communication in Latin America and the CaribbeanThe more information about current network conditions available to a transport protocol, the more efficiently it can be use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of ...
On estimating end-to-end network path properties
Workshop on data communication in Latin America and the CaribbeanThe more information about current network conditions available to a transport protocol, the more efficiently it can use the network to transfer its data. In networks such as the Internet, the transport protocol must often form its own estimates of ...
Comments