Abstract

BBRv2, proposed by Google, aims at addressing BBR’s shortcomings of unfairness against loss-based congestion control algorithms (CCAs) and excessive retransmissions in shallow-buffered networks. In this paper, we first comprehensively study BBRv2’s performance under various network conditions and show that BBRv2 mitigates the shortcomings of BBR. Nevertheless, BBRv2’s benefits come with several costs, including slow responsiveness to bandwidth dynamics and low resilience to random losses. We then propose BBRv2+ to address BBRv2’s performance issues without sacrificing its advantages over BBR. To this end, BBRv2+ uses delay information to cautiously guide the aggressiveness of its bandwidth probing. In doing so, it achieves fast responsiveness to bandwidth dynamics and fairness against loss-based CCAs at the same time. BBRv2+ also integrates mechanisms for improved resilience to random losses and network jitter. Extensive experiments demonstrate the effectiveness of BBRv2+. Specifically, it achieves 25% higher throughput and comparable queuing delay in comparison with BBRv2 in high-mobility network scenarios.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.