Standardization and Research Trends of BBR Congestion Control Algorithm 


Vol. 44,  No. 9, pp. 1713-1722, Sep.  2019
10.7840/kics.2019.44.9.1713


PDF
  Abstract

In the current internet, more than 90% of the web applications use TCP as transport layer protocol. Google in late 2016 proposed the Bottleneck Bandwidth and Round-trip propagation time (BBR) as a new congestion control algorithms to improve the overall network performance. Unlike the existing loss-based congestion control algorithms, BBR works without filling the buffer of the bottlenecks, thus it reduces packet losses and minimizes the end-to-end delays; therefore, draws attention from many researchers. In this paper, firstly, we observe the BBR’s behavior characteristics, then decribe the current standardization, R&D and research issues of BBR algorithm.

  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.


  Cite this article

[IEEE Style]

G. Kim, Y. Song, C. Park, Y. Cho, "Standardization and Research Trends of BBR Congestion Control Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 44, no. 9, pp. 1713-1722, 2019. DOI: 10.7840/kics.2019.44.9.1713.

[ACM Style]

Geon-Hwan Kim, Yeong-Jun Song, Chang-Hoon Park, and You-Ze Cho. 2019. Standardization and Research Trends of BBR Congestion Control Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 44, 9, (2019), 1713-1722. DOI: 10.7840/kics.2019.44.9.1713.

[KICS Style]

Geon-Hwan Kim, Yeong-Jun Song, Chang-Hoon Park, You-Ze Cho, "Standardization and Research Trends of BBR Congestion Control Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 44, no. 9, pp. 1713-1722, 9. 2019. (https://doi.org/10.7840/kics.2019.44.9.1713)

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880