BIC TCP
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
BIC TCP (Binary Increase Congestion control) is one of the congestion control algorithms that can be used for Transmission Control Protocol (TCP). BIC is optimized for high-speed networks with high latency: so-called long fat networks. For these networks, BIC has significant advantage over previous congestion control schemes in correcting for severely underutilized bandwidth.
BIC implements a unique congestion window (cwnd) algorithm. This algorithm tries to find the maximum cwnd by searching in three parts: binary search increase, additive increase, and slow start. When a network failure occurs, the BIC uses multiplicative decrease in correcting the cwnd.
BIC TCP is implemented and used by default in Linux kernels 2.6.8 and above. The default implementation was again changed to CUBIC TCP in the 2.6.19 version.
BIC TCP (Binary Increase Congestion control) is one of the congestion control algorithms that can be used for Transmission Control Protocol (TCP). BIC is optimized for high-speed networks with high latency: so-called long fat networks. For these networks, BIC has significant advantage over previous congestion control schemes in correcting for severely underutilized bandwidth.
BIC implements a unique congestion window (cwnd) algorithm. This algorithm tries to find the maximum cwnd by searching in three parts: binary search increase, additive increase, and slow start. When a network failure occurs, the BIC uses multiplicative decrease in correcting the cwnd.
BIC TCP is implemented and used by default in Linux kernels 2.6.8 and above. The default implementation was again changed to CUBIC TCP in the 2.6.19 version. bic_inc = (w max - cwnd) / 2; else // slow start OR additive bic_inc = cwnd - w max ; if (bic_inc > S max ) // additive bic_inc = S max ; else if (bic_inc min ) // binary search OR slow start bic_inc = S min ; cwnd = cwnd + (bic_inc / cwnd); If one or more packets are dropped, the cwnd is reduced using multiplicative decrease.
This requires β, which is used in decreasing cwnd by (100×β)%. In the case of two flows, one with a large cwnd and the other a small cwnd, fast convergence is used to decrease the greater cwnd flow's w max at a greater rate than the smaller cwnd's flow to allow faster convergence of the greater cwnd's flow when increasing its cwnd.
One step of decreasing cwnd: if (cwnd max ) // fast convergence w max = cwnd * (2-β) / 2; else w max = cwnd; cwnd = cwnd * (1-β);
See also
TCP congestion avoidance algorithm SCTP CUBIC TCP
External links
Home Page.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1372229264 under CC BY-SA 4.0; modifications have been made.