Abstract
A TCP/IP network utilizes several congestion control schemes: end-to-end flow control and congestion avoidance, gateway congestion control, and explicit closed-loop feedback (i.e., source quench). The evolution of TCP/IP includes enhanced gateway congestion control algorithms (i.e., Random Early Detect) and a variety of incremental improvements to TCP including selective acknowledgement and possibly end-to-end congestion avoidance (i.e., TCP/Vegas). We focus on end-to-end congestion avoidance algorithms for TCP, specifically those algorithms that use change in packet transit times as an indicator of network congestion. TCP/Vegas is the most well known algorithm based on this form of congestion control. We fmd that TCPNegas does increase throughput primarily by avoiding time-outs. However its assessment of congestion is prone to significant error which can lead to increased queue levels at the bottleneck link. By studying TCPNegas and other algorithms, our goal is to understand the issues associated with end-toend congestion avoidance schemes that monitor change in packet delays.
This paper is organized as follows. First we introduce end-to-end congestion avoidance. Next, using simulation, we explore the various issues and challenges associated with end-to-end congestion avoidance by demonstrating and analyzing several end-to-end congestion avoidance algorithms. We conclude with a discussion of key issues associated with end-to-end congestion avoidance and identify future work.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35388-3_42
Chapter PDF
Similar content being viewed by others
References
J. Ahn, P. Danzig, Z. Liu, L. Yan, “Evaluation of TCP Vegas: Emulation and Experiment”, ACM SIGCOMM95.
O. Ait-Hellal, E. Allman, “Analysis of TCP-Vegas and TCP-Reno”, ICC, June 1997.
L. Brakmo, S. OMalley, L. Peterson, “TCP Vegas: New Techniques for Congestion Detection and Avoidance”, ACM SIGCOMM94, 1994.
K. Fall, S. Floyd, S. McCanne, network simulation ns, “http://wwwmash.cs.berkeley.edu/ns/ns.html, 1996.
S. Floyd, “TCP and Explicit Congestion Notification”, ACM Computer Communications Review, October 1994.
S. Floyd, K. Ramakrshnan, “A Proposal to add Explicit Congestion Notification (ECN) to Ipv6 and to TCP”, Internet Draft, Nov 1997, draftkksjf-ecn-00.txt.
S. Floyd, V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, August 1993.
Z. Haas, “Adaptive Admission Control”, ACM SIGCOMM911, 1991.
V. Jacobson, “Congestion Avoidance and Control”, ACM SIGCOMM88, 1988.
S. Keshav, “Packet-Pair Flow Control”, http://www.cs.cornell.edu/skeshav/doc/94/2-17.ps.
A. Mankin, K. Ramakrishnan, “Gateway Congestion Control Survey”, RFC 1254, 1991.
J. Martin, A. Nilsson, “Congestion Control in HPR”, IEEE GLOBECOM97.
J. Martin, et. Al., “A Comparison of TCP/Reno and RTP Transport Protocols”, IBM Technical Report TR-29. 2337.
J. Nilausen, “APPN Networks”, Wiley 1994.
R. Stevens, TCP/IP Illustrated, Volume 1, Addison-Wesley, 1994.
Z. Wang, J. Crowcroft, “A New Congestion Control Scheme: Slow-start and Search (Tri-S), ACM Computer Communication Review, V21 #1, January 1991.
Z. Wang, J. Crowcroft, “Eliminating Periodic Packet Losses in the 4.3-Tahoe BSD TCP Congestion Control Algorithm”, ACM Computer Communication Review, April 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Martin, J., Nilsson, A. (1998). On End-to-End Congestion Avoidance for TCP/IP. In: van As, H.R. (eds) High Performance Networking. HPN 1998. IFIP — The International Federation for Information Processing, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35388-3_32
Download citation
DOI: https://doi.org/10.1007/978-0-387-35388-3_32
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5397-4
Online ISBN: 978-0-387-35388-3
eBook Packages: Springer Book Archive