Improved Bottleneck Bandwidth and Round-Trip Propagation Congestion Control Algorithm for Round-Trip Time Fairness

Traditional congestion-control algorithms based on packet loss are more favorable for short round-trip time (RTT) flows. However, when the flow occupies the bottleneck bandwidth, the effect of bottleneck bandwidth and round-trip propagation time (BBR) congestion-control algorithm is on contrary. A s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of advanced computational intelligence and intelligent informatics Ročník 27; číslo 3; s. 346 - 351
Hlavní autoři: Zhao, Zhicheng, Cao, Weihua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Tokyo Fuji Technology Press Co. Ltd 01.05.2023
Témata:
Algorithms
Bandwidths
Bottlenecks
Congestion
Control algorithms
Control theory
Propagation
ISSN:1343-0130, 1883-8014
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Traditional congestion-control algorithms based on packet loss are more favorable for short round-trip time (RTT) flows. However, when the flow occupies the bottleneck bandwidth, the effect of bottleneck bandwidth and round-trip propagation time (BBR) congestion-control algorithm is on contrary. A short RTT flow may become “starved” after multiple iterations, which leads to a significant fairness problem in the BBR. This study analyzed the convergence using the BBR algorithm principle and the effect of RTT on fairness. Thereafter, we proposed an improved algorithm termed BBR-f, constructed an inverse proportional function of RTT, and added a gain function to the congestion window (CWND) gain. A simulation experiment using the ns-3 network simulator platform shows that the algorithm can optimize fairness and improve bottleneck-linked bandwidth utilization. Finally, the Jain fair index was used to evaluate its effectiveness, and a comparison experiment with traditional algorithms was performed to verify the efficiency of the proposed method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1343-0130
1883-8014
DOI:10.20965/jaciii.2023.p0346