Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC 


Vol. 49,  No. 1, pp. 95-103, Jan.  2024
10.7840/kics.2024.49.1.95


PDF
  Abstract

Currently, over 90% of Internet traffic uses the TCP (Transmission Control Protocol). In 2016, Google proposed a new congestion control algorithm called BBRv1 (Bottleneck Bandwidth Round-trip Propagation Version 1) to improve network speed. However, BBRv1 had several issues with small buffers, leading Google to propose BBRv2 in 2019. Unfortunately, when flows of BBRv2 and CUBIC share bottleneck bandwidth in a large buffer (2 BDP or more), it causes fairness issues. This paper proposes the F-BBRv2 algorithm to address the fairness issue between BBRv2 and CUBIC.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Related Articles
  Cite this article

[IEEE Style]

H. Cho and Y. Cho, "Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC," The Journal of Korean Institute of Communications and Information Sciences, vol. 49, no. 1, pp. 95-103, 2024. DOI: 10.7840/kics.2024.49.1.95.

[ACM Style]

Hyo-Seop Cho and You-Ze Cho. 2024. Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC. The Journal of Korean Institute of Communications and Information Sciences, 49, 1, (2024), 95-103. DOI: 10.7840/kics.2024.49.1.95.

[KICS Style]

Hyo-Seop Cho and You-Ze Cho, "Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC," The Journal of Korean Institute of Communications and Information Sciences, vol. 49, no. 1, pp. 95-103, 1. 2024. (https://doi.org/10.7840/kics.2024.49.1.95)
Vol. 49, No. 1 Index