Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC

  • Cho, Hyo-Seop; 
  • Kim, Geon-Hwan; 
  • Cho, You-Ze
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

Google proposed Bottleneck Bandwidth Round-trip propagation time version2 (BBRv2) congestion control algorithm to solve the bandwidth fairness problem of the BBRv1. The bandwidth fairness of BBRv2 depends on the Bandwidth Delay Product (BDP). When the bottleneck buffer is less than 2BDP, BBRv2 improves bandwidth unfairness in bandwidth sharing with loss-based congestion control algorithm such as CUBIC over BBRv1. However, when the bottleneck buffer exceeds 2BDP, BBRv2 has bandwidth fairness issues. In this paper, we proposed F-BBRv2 to solve the bandwidth fairness problem of BBRv2 by using the min_RTT value and adaptive pacing_gain method.

키워드

TCP congestion control algorithm; BBRv2; CUBIC; Bandwidth Fairness
제목
Improvement of Bandwidth Fairness between TCP BBRv2 and CUBIC
저자
Cho, Hyo-Seop; Kim, Geon-Hwan; Cho, You-Ze
DOI
10.1109/APCC55198.2022.9943682
발행일
2022
유형
Proceedings Paper
저널명
2022 27TH ASIA PACIFIC CONFERENCE ON COMMUNICATIONS (APCC 2022): CREATING INNOVATIVE COMMUNICATION TECHNOLOGIES FOR POST-PANDEMIC ERA
페이지
588 ~ 589