Transmission Control Protocol (TCP) uses acongestion control algorithm that includes various aspects of anadditive increase/multiplicative decrease (AIMD) scheme, along with other schemes includingslow start[1] and acongestion window (CWND), to achieve congestion avoidance. TheTCP congestion-avoidance algorithm is the primary basis forcongestion control in the Internet.[2][3][4] Per theend-to-end principle, congestion control is largely a function ofinternet hosts, not the network itself. There are several variations and versions of the algorithm implemented inprotocol stacks ofoperating systems of computers that connect to theInternet.
To avoidcongestive collapse, TCP uses a multi-faceted congestion-control strategy. For each connection, TCP maintains a CWND, limiting the total number of unacknowledged packets that may be in transit end-to-end. This is somewhat analogous to TCP'ssliding window used forflow control.
Theadditive increase/multiplicative decrease (AIMD) algorithm is aclosed-loop control algorithm. AIMD combines linear growth of the congestion window with an exponential reduction when congestion occurs. Multiple flows using AIMD congestion control will eventually converge to use equal amounts of a contended link.[5]
This is the algorithm that is described inRFC 5681 for the "congestion avoidance" state.[6]
In TCP, thecongestion window (CWND) is one of the factors that determines the number of bytes that can be sent out at any time. The congestion window is maintained by the sender and is a means of preventinga link between the sender and the receiver from becoming overloaded with too much traffic. This should not be confused with the sliding window maintained by the sender which exists to preventthe receiver from becoming overloaded. The congestion window is calculated by estimating how much congestion there is on the link.
When a connection is set up, the congestion window, a value maintained independently at each host, is set to a small multiple of themaximum segment size (MSS) allowed on that connection. Further variance in the congestion window is dictated by anadditive increase/multiplicative decrease (AIMD) approach. This means that if all segments are received and the acknowledgments reach the sender on time, some constant is added to the window size. It will follow different algorithms.
Asystem administrator may adjust the maximum window size limit, or adjust the constant added during additive increase, as part ofTCP tuning.
The flow of data over a TCP connection is also controlled by the use of thereceive window advertised by the receiver. A sender can send data less than its own congestion window and thereceive window.
Slow start, defined byRFC 5681.[7] is part of thecongestion control strategy used by TCP in conjunction with otheralgorithms to avoid sending more data than the network is capable of forwarding, that is, to avoid causing network congestion.
Slow start begins initially with a congestion window size (CWND) of 1, 2, 4 or 10 MSS.[8][3]: 1 The value for the congestion window size can be increased by 1 MSS with eachacknowledgment (ACK) received, effectively doubling the window size eachRTT.[a]
The transmission rate will be increased by the slow-start algorithm until either a packet loss is detected, the receiver's advertised window (rwnd) becomes the limiting factor, orslow start threshold (ssthresh) is reached, which is used to determine whether the slow start or congestion avoidance algorithm is used, a value set to limit slow start.
If the CWND reachesssthresh, TCP switches to the congestion avoidance algorithm. It should be increased by up to 1 MSS for each RTT. A common formula is thateach new ACK increases the CWND byMSS * MSS / CWND. It increases almost linearly and provides an acceptable approximation.
If a loss event occurs, TCP assumes that it is due to network congestion and takes steps to reduce the offered load on the network. These measures depend on the exact TCP congestion avoidance algorithm used.
When a TCP sender detects segment loss using the retransmission timer and the given segment has not yet been resent, the value ofssthresh must be set to no more than half of the amount of data that has been sent but not yet cumulatively acknowledged or2 * MSS, whichever value is greater.
Slow start assumes that unacknowledged segments are due to network congestion. While this is an acceptable assumption for many networks, segments may be lost for other reasons, such as poordata link layer transmission quality. Thus, slow start can perform poorly in situations with poor reception, such aswireless networks.
The slow start protocol also performs badly for short-lived connections. Olderweb browsers would create many consecutive short-lived connections to the web server, and would open and close the connection for each file requested. This kept most connections in the slow start mode, which resulted in poor response time. To avoid this problem, modern browsers either open multiple connections simultaneously orreuse one connection for all files requested from a particular web server. Connections, however, cannot be reused for the multiple third-party servers used by web sites to implementweb advertising,sharing features ofsocial networking services,[9] andcounter scripts of web analytics.
Fast retransmit is an enhancement toTCP that reduces the time a sender waits before retransmitting a lost segment. A TCP sender normally uses a simple timer to recognize lost segments. If an acknowledgment is not received for a particular segment within a specified time (a function of the estimatedround-trip delay time), the sender will assume the segment was lost in the network and will retransmit the segment.
Duplicate acknowledgment is the basis for the fast retransmit mechanism. After receiving a packet an acknowledgement is sent for the last in-order byte of data received. For an in-order packet, this is effectively the last packet's sequence number plus the current packet's payload length. If the next packet in the sequence is lost but a third packet in the sequence is received, then the receiver can only acknowledge the last in-order byte of data, which is the same value as was acknowledged for the first packet. The second packet is lost and the third packet is not in order, so the last in-order byte of data remains the same as before. Thus aDuplicate acknowledgment occurs. The sender continues to send packets, and a fourth and fifth packet are received by the receiver. Again, the second packet is missing from the sequence, so the last in-order byte has not changed. Duplicate acknowledgments are sent for both of these packets.
When a sender receives three duplicate acknowledgments, it can be reasonably confident that the segment carrying the data that followed the last in-order byte specified in the acknowledgment was lost. A sender with fast retransmit will then retransmit this packet immediately without waiting for its timeout. On receipt of the retransmitted segment, the receiver can acknowledge the last in-order byte of data received. In the above example, this would acknowledge to the end of the payload of the fifth packet. There is no need to acknowledge intermediate packets since TCP uses cumulative acknowledgments by default.
The names Reno and Tahoe are the names of releases of theBSD UNIX operating system, and were used to refer to the congestion control algorithms (CCAs) at least as early a 1996 paper by Kevin Fall and Sally Floyd.[10][failed verification]
The following is one possible classification according to the following properties:
Some well-known congestion avoidance mechanisms are classified by this scheme as follows:
| Variant | Feedback | Required changes | Benefits | Fairness |
|---|---|---|---|---|
| (New) Reno | Loss | — | — | Delay |
| Vegas | Delay | Sender | Less loss | Proportional |
| High Speed | Loss | Sender | High bandwidth | |
| BIC | Loss | Sender | High bandwidth | |
| CUBIC | Loss | Sender | High bandwidth | |
| C2TCP[11][12] | Loss/Delay | Sender | Ultra-low latency and high bandwidth | |
| NATCP[13] | Multi-bit signal | Sender | Near Optimal Performance | |
| Elastic-TCP | Loss/Delay | Sender | High bandwidth/short & long-distance | |
| Agile-TCP | Loss | Sender | High bandwidth/short-distance | |
| H-TCP | Loss | Sender | High bandwidth | |
| FAST | Delay | Sender | High bandwidth | Proportional |
| Compound TCP | Loss/Delay | Sender | High bandwidth | Proportional |
| Westwood | Loss/Delay | Sender | Lossy links | |
| Jersey | Loss/Delay | Sender | Lossy links | |
| BBR[14] | Delay | Sender | BLVC,Bufferbloat | |
| CLAMP | Multi-bit signal | Receiver, Router | Variable-rate links | Max-min |
| TFRC | Loss | Sender, Receiver | No Retransmission | Minimum delay |
| XCP | Multi-bit signal | Sender, Receiver, Router | BLFC | Max-min |
| VCP | 2-bit signal | Sender, Receiver, Router | BLF | Proportional |
| MaxNet | Multi-bit signal | Sender, Receiver, Router | BLFSC | Max-min |
| JetMax | Multi-bit signal | Sender, Receiver, Router | High bandwidth | Max-min |
| RED | Loss | Router | Reduced delay | |
| Prague[15] | Single-bit signal | Sender, Receiver, Router | Low latency, low loss, scalable throughput (L4S[16]) | |
| ECN | Single-bit signal | Sender, Receiver, Router | Reduced loss |
TCP Tahoe and Reno algorithms were retrospectively named after the versions or flavors of the4.3BSD operating system in which each first appeared (which were themselves named afterLake Tahoe and the nearby city ofReno, Nevada). The Tahoe algorithm first appeared in 4.3BSD-Tahoe (which was made to support theCCI Power 6/32 "Tahoe" minicomputer), and was later made available to non-AT&T licensees as part of the 4.3BSD Networking Release 1; this ensured its wide distribution and implementation. Improvements were made in 4.3BSD-Reno and subsequently released to the public as Networking Release 2 and later 4.4BSD-Lite.
While both consider retransmission timeout (RTO) and duplicate ACKs as packet loss events, the behavior of Tahoe and Reno differ primarily in how they react to duplicate ACKs:
In both Tahoe and Reno, if an ACK times out (RTO timeout), slow start is used, and both algorithms reduce the congestion window to 1 MSS.[citation needed]
TCP New Reno, defined byRFC 6582 (which obsolesces previous definitions inRFC 3782 andRFC 2582), improves retransmission during the fast-recovery phase of TCP Reno.
During fast recovery, to keep the transmit window full, for every duplicate ACK that is returned, a new unsent packet from the end of the congestion window is sent.
The difference from Reno is that New Reno does not halve ssthresh immediately which may reduce the window too much if multiple packet losses occur. It does not exit fast-recovery and reset ssthresh until it acknowledges all of the data.
After retransmission, newly acknowledged data have two cases:
It uses a variable called "recover" to record how much data needs to be recovered. After a retransmit timeout, it records the highest sequence number transmitted in the recover variable and exits the fast recovery procedure. If this sequence number is acknowledged, TCP returns to the congestion avoidance state.
A problem occurs with New Reno when there are no packet losses but instead, packets are reordered by more than 3 packet sequence numbers. In this case, New Reno mistakenly enters fast recovery. When the reordered packet is delivered, duplicate and needless retransmissions are immediately sent.
New Reno performs as well as SACK at low packet error rates and substantially outperforms Reno at high error rates.[19]
Until the mid-1990s, all of TCP's set timeouts and measured round-trip delays were based upon only the last transmitted packet in the transmit buffer.University of Arizona researchersLarry Peterson andLawrence Brakmo introduced TCP Vegas in which timeouts were set and round-trip delays were measured for every packet in the transmit buffer. In addition, TCP Vegas uses additive increases in the congestion window. In a comparison study of various TCPCCAs, TCP Vegas appeared to be the smoothest followed by TCP CUBIC.[20]
TCP Vegas was not widely deployed outside Peterson's laboratory but was selected as the default congestion control method forDD-WRT firmware v24 SP2.[21]
TCP Hybla[22][23] aims to eliminate penalties to TCP connections that use high-latency terrestrial or satellite radio links. Hybla improvements are based on analytical evaluation of the congestion window dynamics.[24]
Binary Increase Congestion control (BIC) is a TCP implementation with an optimized CCA for high-speed networks with high latency, known aslong fat networks (LFNs).[25] BIC is used by default inLinux kernels 2.6.8 through 2.6.18.[citation needed]
CUBIC is a less aggressive and more systematic derivative of BIC, in which the window is a cubic function of time since the last congestion event, with the inflection point set to the window prior to the event. CUBIC is used by default inLinux kernels since version 2.6.19.
Agile-SD is a Linux-based CCA which is designed for the real Linux kernel. It is a receiver-side algorithm that employs a loss-based approach using a novel mechanism, calledagility factor (AF). to increase the bandwidth utilization over high-speed and short-distance networks (low bandwidth-delay product networks) such as local area networks or fiber-optic network, especially when the applied buffer size is small.[26] It has been evaluated by comparing its performance to Compound TCP (the default CCA in MS Windows) and CUBIC (the default of Linux) using NS-2 simulator. It improves the total performance up to 55% in term of average throughput.
Westwood+ is a sender-only modification of TCP Reno that optimizes the performance of TCP congestion control over both wired andwireless networks. TCP Westwood+ is based on end-to-endbandwidth estimation to set the congestion window and slow-start threshold after a congestion episode, that is, after three duplicate acknowledgments or a timeout. The bandwidth is estimated by averaging the rate of returning acknowledgment packets. In contrast with TCP Reno, which blindly halves the congestion window after three duplicate ACKs, TCP Westwood+ adaptively sets a slow-start threshold and a congestion window that takes into account an estimate of bandwidth available at the time congestion is experienced. Compared to Reno and New Reno, Westwood+ significantly increases throughput over wireless links and improves fairness in wired networks.[citation needed]
Compound TCP is aMicrosoft implementation of TCP which maintains two different congestion windows simultaneously, with the goal of achieving good performance on LFNs while not impairingfairness. It has been widely deployed in Windows versions since MicrosoftWindows Vista andWindows Server 2008 and has been ported to older Microsoft Windows versions as well asLinux.
TCP Proportional Rate Reduction (PRR)[27] is an algorithm designed to improve the accuracy of data sent during recovery. The algorithm ensures that the window size after recovery is as close as possible to the slow start threshold. In tests performed byGoogle, PRR resulted in a 3–10% reduction in average latency and recovery timeouts were reduced by 5%.[28] PRR is available inLinux kernels since version 3.2.[29]
Bottleneck Bandwidth and Round-trip propagation time (BBR) is a CCA developed at Google in 2016.[30] While most CCAs are loss-based, in that they rely on packet loss to detect congestion and lower rates of transmission, BBR, likeTCP Vegas, is model-based. The algorithm uses the maximum bandwidth and round-trip time at which the network delivered the most recent flight of outbound data packets to build a model of the network. Each cumulative or selective acknowledgment of packet delivery produces a rate sample that records the amount of data delivered over the time interval between the transmission of a data packet and the acknowledgment of that packet.[31]
When implemented atYouTube, BBRv1 yielded an average of 4% higher network throughput and up to 14% in some countries.[32] BBR has been available for Linux TCP since Linux 4.9.[33] It is also available forQUIC.[34]
BBR version 1 (BBRv1) fairness to non-BBR streams is disputed. While Google's presentation shows BBRv1 co-existing well with CUBIC,[30] researchers like Geoff Huston and Hock, Bless and Zitterbart found it unfair to other streams and not scalable.[35] Hock et al. also found "some severe inherent issues such as increased queuing delays, unfairness, and massive packet loss" in the BBR implementation of Linux 4.9.[36] Soheil Abbasloo et al. (authors of C2TCP) show that BBRv1 doesn't perform well in dynamic environments such as cellular networks.[11][12] They have also shown that BBR has an unfairness issue. For instance, when aCUBIC flow (which is the defaultTCP implementation in Linux, Android, and MacOS) coexists with a BBR flow in the network, the BBR flow can dominate the CUBIC flow and get the whole link bandwidth from it (see figure 16 in[11]).
Version 2 attempts to deal with the issue of unfairness when operating alongside loss-based congestion management such as CUBIC.[37] In BBRv2 the model used by BBRv1 is augmented to include information about packet loss and information fromExplicit Congestion Notification (ECN).[38] Whilst BBRv2 may at times have lower throughput than BBRv1 it is generally considered to have bettergoodput.[citation needed]
Version 3 (BBRv3) fixes two bugs in BBRv2 (premature end of bandwidth probing, bandwidth convergence) and performs some performance tuning. There is also a variant, termed BBR.Swift, optimized for datacenter-internal links: it uses network_RTT (excluding receiver delay) as the main congestion control signal.[38]
Cellular Controlled Delay TCP (C2TCP)[11][12] was motivated by the lack of a flexible end-to-end TCP approach that can satisfy variousQoS requirements for different applications without requiring any changes in the network devices. C2TCP aims to satisfy ultra-lowlatency and high-bandwidth requirements of applications such asvirtual reality,video conferencing,online gaming,vehicular communication systems, etc. in a highly dynamic environment such as currentLTE and future5Gcellular networks. C2TCP works as anadd-on on top of loss-based TCP (e.g. Reno, NewReno,CUBIC,BIC, ...), it is only required to be installed on the server-side and makes the average delay of packets bounded to the desired delays set by the applications.
Researchers atNYU[39] showed that C2TCP outperforms the delay and delay-variation performance of various state-of-the-art TCP schemes. For instance, they showed that compared to BBR, CUBIC, and Westwood on average, C2TCP decreases the average delay of packets by about 250%, 900%, and 700% respectively on various cellular network environments.[11]
Elastic-TCP was proposed in February 2019 to increase bandwidth utilization over high-BDP networks in support of cloud computing. It is a Linux-based CCA that is designed for the Linux kernel. It is a receiver-side algorithm that employs a loss-delay-based approach using a novel mechanism called a window-correlated weighting function (WWF). It has a high level of elasticity to deal with different network characteristics without the need for human tuning. It has been evaluated by comparing its performance to Compound TCP (the default CCA in MS Windows), CUBIC (the default for Linux) and TCP-BBR (the default of Linux 4.9 used by Google) using the NS-2 simulator and testbed. Elastic-TCP significantly improves the total performance in terms of average throughput, loss ratio, and delay.[40]
Soheil Abbasloo et al. proposed NATCP (Network-Assisted TCP)[13] acontroversial[according to whom?] TCP design targetingmulti-access edge computing (MEC). The key idea of NATCP is that if the characteristics of the network were known beforehand, TCP would have been designed differently. Therefore, NATCP employs the available features and properties in the current MEC-based cellular architectures to push the performance of TCP close to the optimal performance. NATCP uses out-of-band feedback from the network to the servers located nearby. The feedback from the network, which includes the capacity of the cellular access link and the minimum RTT of the network, guides the servers to adjust their sending rates. As preliminary results show, NATCP outperforms the state-of-the-art TCP schemes.[13][41]
TCP New Reno was the most commonly implemented algorithm,[citation needed] SACK support is very common[citation needed] and is an extension to Reno/New Reno. Most others are competing proposals that still need evaluation. Starting with 2.6.8 the Linux kernel switched the default implementation from New Reno toBIC. The default implementation was again changed to CUBIC in the 2.6.19 version.FreeBSD from version 14.X onwards also uses CUBIC as the default algorithm.[53] Previous version used New Reno. However, FreeBSD supports a number of other choices.[54]
When the per-flow product of bandwidth and latency increases, regardless of the queuing scheme, TCP becomes inefficient and prone to instability. This becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links.
TCP Interactive (iTCP)[55] allows applications to subscribe to TCP events and respond accordingly enabling various functional extensions to TCP from outside TCP layer. Most TCP congestion schemes work internally. iTCP additionally enables advanced applications to directly participate in congestion control such as to control the source generation rate.
Zeta-TCP detects congestion from both latency and loss rate measures. To maximize thegoodput Zeta-TCP and applies different congestion window backoff strategies based on the likelihood of congestion. It also has other improvements to accurately detect packet losses, avoiding retransmission timeout retransmission; and accelerate and control the inbound (download) traffic.[56]
CCAs may be classified in relation to network awareness, meaning the extent to which these algorithms are aware of the state of the network. This consist of three primary categories: black box, grey box, and green box.[57]
Black box algorithms offer blind methods of congestion control. They operate only on the binary feedback received upon congestion and do not assume any knowledge concerning the state of the networks which they manage.
Grey box algorithms use time-based measurement, such as RTT variation and rate of packet arrival, in order to obtain measurements and estimations of bandwidth, flow contention, and other knowledge of network conditions.
Green box algorithms offer bimodal methods of congestion control which measures the fair share of total bandwidth which should be allocated for each flow, at any point, during the system's execution.
The following algorithms require custom fields to be added to the TCP packet structure:
 | This sectiondoes notcite anysources. Please helpimprove this section byadding citations to reliable sources. Unsourced material may be challenged andremoved.(July 2022) (Learn how and when to remove this message) |
{{cite journal}}:Cite journal requires|journal= (help){{cite journal}}:Cite journal requires|journal= (help)