TCP Congestion Avoidance Algorithm - Other TCP Congestion Avoidance Algorithms

Other TCP Congestion Avoidance Algorithms

• FAST TCP
• H-TCP
• Data Center TCP
• High Speed TCP
• HSTCP-LP
• TCP-Illinois
• TCP-LP
• TCP SACK
• Scalable TCP
• TCP Veno
• Westwood
• Westwood+
• XCP
• YeAH-TCP
• TCP-FIT
• Congestion Avoidance with Normalized Interval of Time (CANIT)

TCP New Reno is the most commonly implemented algorithm, SACK support is very common and is an extension to Reno/New Reno. Most others are competing proposals which still need evaluation. Starting with 2.6.8 the Linux kernel switched the default implementation from Reno to BIC. The default implementation was again changed to CUBIC in the 2.6.19 version. FreeBSD uses NewReno as the default algorithm. However, it supports a number of other choices.

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) 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 the congestions from both the latency and loss rate measures, and applies different CWND backoff strategies based on the likelihood of the congestions to maximize the goodput. It also has a couple of other improvements to accurately detect the packet losses, avoiding RTO retransmission; and accelerate/control the inbound (download) traffic.