CUBIC TCP
TCP congestion avoidance algorithm
≈ 2 min read
Names in other languages
- caCUBIC TCP
- EnglishCUBIC TCP
- eoCUBIC TCP
- FrançaisCUBIC TCP
- РусскийCUBIC TCP
- 中文CUBIC TCP
- DeutschCUBIC
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
CUBIC is a network congestion avoidance algorithm for TCP which can achieve high bandwidth connections over networks more quickly and reliably in the face of high latency than earlier algorithms. It helps optimize long fat networks. In 2006, the first CUBIC implementation was released in Linux kernel 2.6.13.
Since kernel version 2.6.19, CUBIC replaces BIC-TCP as the default TCP congestion control algorithm in the Linux kernel. MacOS adopted TCP CUBIC with the OS X Yosemite release in 2014, while the previous release OS X Mavericks still used TCP New Reno.
Microsoft adopted it by default in Windows 10.1709 Fall Creators Update (2017), and Windows Server 2016 1709 update. \begin{array}{lcr} cwnd \ = \ C(T-K)^3 + w_ \\ \textrm{where} \ K = \sqrt[3]{\frac{w_ (1-\beta)}{C}} \end{array} In August 2023, RFC 9438 was published as a Proposed Standard, obsoleting the older experimental RFC 8312. The standardized version retains the recommended multiplicative decrease factor β (denoted as β cubic ) of 0.7, while formally integrating algorithmic improvements including HyStart++ (hybrid slow start), improved response to spurious congestion events, and transport-agnostic optimization for protocols like QUIC.
Alternatives
Apart from window based algorithms like Cubic, there are rate based algorithms (including TCP BBR from Google) that works differently using "sending rate" instead of the window. Unlike CUBIC, which relies primarily on packet loss as a congestion signal, BBR uses a model-based approach that estimates the available bandwidth and minimum RTT of the network path.
BBR operates by cycling through four states: STARTUP, DRAIN, PROBE_BW, and PROBE_RTT, continuously measuring and adapting to network conditions. The fundamental difference in approach means that BBR can achieve higher throughput in networks with shallow buffers or where random packet loss occurs (such as wireless networks), as it doesn't interpret all losses as congestion signals.
However, studies have shown that when BBR flows compete with CUBIC flows, BBR can be more aggressive and may dominate bandwidth allocation.
See also
TCP congestion avoidance algorithm SCTP Compound TCP
External links
BIC & CUBIC Home Page at NC State University.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1377421504 under CC BY-SA 4.0; modifications have been made.