BBR Advanced (BBR-A) — Reduced retransmissions with improved fairness | Zendy

Imtiaz Mahmud | Zendy; You-Ze Cho | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

BBR Advanced (BBR-A) — Reduced retransmissions with improved fairness

Author(s) -

Imtiaz Mahmud,

You-Ze Cho

Publication year - 2020

Publication title -

ict express

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.733

H-Index - 22

ISSN - 2405-9595

DOI - 10.1016/j.icte.2020.05.009

Subject(s) - computer network , bottleneck , emulation , computer science , queue , network packet , network congestion , throughput , bandwidth (computing) , telecommunications , economics , embedded system , wireless , economic growth

In 2016, Google proposed Bottleneck Bandwidth and Round-trip-time (BBR), a new TCP congestion control algorithm to avoid bottleneck queue formation and utilize underlying bandwidth in full. However, recent reports have found significant flaws in BBR, especially a high packet retransmissions problem, and throughput unfairness issue. We propose BBR Advanced (BBR-A) that resolves these issues by halving the congestion window and slowing down the pacing gain for actual congestion events, which it decides based on packet losses and RTT. Mininet emulation experiments confirm that BBR-A reduces retransmissions up to 60% and increases fairness index up to 10% in comparison with BBR.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research