HackerPapers

arXiv:2008.07699cs.NI

Evaluating BBRv2 on the Dropbox Edge Network

Alexey Ivanov

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Nowadays, loss-based TCP congestion controls in general and CUBIC specifically became the de facto standard for the Internet. BBR congestion control challenges the loss-based approach by modeling the network based on estimated bandwidth and round-trip time. At Dropbox, we've been using BBRv1 since 2017 and are accustomed to its pros and cons. BBRv2 introduces a set of improvements to network modeling (explicit loss targets and inflight limits) and fairness (differential probing and headroom for new flows.) In this paper, we go over experimental data gathered on the Dropbox Edge Network. We compare BBRv2 to BBRv1 and CUBIC showing that BBRv2 is a definite improvement over both of them. We also show that BBRv2 experimental results match its theoretical design principles.

arXiv comments
7 pages, 15 figures, netdev 0x14 conference
Journal reference
DOI
Subjects
cs.NINetworking and Internet Architecture

On Hacker News

No comments linking this paper were found in the collected sources. Found in 3 HN submissions from Aug 2020 to Feb 2026. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.