Английская Википедия:CUBIC TCP

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description Шаблон:Use American English Шаблон:Use mdy dates Шаблон:Refimprove 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.

Characteristics

CUBIC is a less aggressive and more systematic derivative of BIC TCP, in which the window size is a cubic function of time since the last congestion event, with the inflection point set to the window size prior to the event. Because it is a cubic function, there are two components to window growth. The first is a concave portion where the window size quickly ramps up to the size before the last congestion event. Next is the convex growth where CUBIC probes for more bandwidth, slowly at first then very rapidly. CUBIC spends a lot of time at a plateau between the concave and convex growth region which allows the network to stabilize before CUBIC begins looking for more bandwidth.

Another major difference between CUBIC and many earlier TCP algorithms is that it does not rely on the cadence of RTTs to increase the window size. CUBIC's window size is dependent only on the last congestion event. With earlier algorithms like TCP New Reno, flows with very short round-trip delay times (RTTs) will receive ACKs faster and therefore have their congestion windows grow faster than other flows with longer RTTs. CUBIC allows for more fairness between flows since the window growth is independent of RTT.

Algorithm

CUBIC increases its window to be real-time dependent, not RTT dependent like BIC. The calculation for cwnd (congestion window) is simpler than BIC, too.

Define the following variables:

• β: Multiplicative decrease factor
• w_max: Window size just before the last reduction
• T: Time elapsed since the last window reduction
• C: A scaling constant
• cwnd: The congestion window at the current time

RFC 8312 indicates the following:

• The unit of all window sizes in this document is segments of the maximum segment size (MSS), and the unit of all times is seconds. (Section 4)
• β SHOULD be set to 0.7 (Section 4.5)
• C SHOULD be set to 0.4 (Section 5)

Then cwnd can be modeled by:

<math display=block>\begin{array}{lcr} cwnd \ = \ C(T-K)^3 + w_Шаблон:Max \\ \textrm{where} \ K = \sqrt[3]{\frac{w_Шаблон:Max(1-\beta)}{C}} \end{array}</math>

See also

• TCP congestion avoidance algorithm
• Шаблон:Section link
• SCTP
• Compound TCP

Apart from window based algorithms like Cubic, there are rate based algorithms (including BBR from Google) that works differently using "sending rate" instead of the window

External links

• BIC & CUBIC Home Page at NC State University.