The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Experimental evaluation of BBR congestion control
Abstract
BBR is a recently proposed congestion control. Instead of using packet loss as congestion signal, like many currently used congestion controls, it uses an estimate of the available bottleneck link bandwidth to determine its sending rate. BBR tries to provide high link utilization while avoiding to create queues in bottleneck buffers. The original publication of BBR shows that it can deliver superior performance compared to Cubic TCP in some environments. This paper provides an independent and extensive experimental evaluation of BBR at higher speeds. The experimental setup uses BBR's Linux kernel 4.9 implementation and typical data rates of 10Gbit/s and 1 Gbit/s at the bottleneck link. The experiments vary the flows' round-trip times, the number of flows, and buffer sizes at the bottleneck. The evaluation considers throughput, queuing delay, packet loss, and fairness. On the one hand, the intended behavior of BBR could be observed with our experiments. On the other hand, some severe inherent issues such as increased queuing delays, unfairness, and massive packet loss were also detected. The paper provides an in-depth discussion of BBR's behavior in different experiment setups.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Cardwell, N., Cheng, Y., Gunn, C. S., Yeganeh, S. H., & Jacobson, V. L. (2017) · Communications of the ACM · doi:10.1145/3009824 · Cited by 889
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
Bufferbloat: Dark Buffers in the Internet
Gettys, J. (2011) · IEEE Internet Computing · doi:10.1109/mic.2011.56 · Cited by 590
Gettys, J., & Nichols, K. (2011) · Queue · doi:10.1145/2063166.2071893 · Cited by 307
Host-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
Revisiting TCP Congestion Control Using Delay Gradients
Hayes, D. A., & Armitage, G. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20798-3_25 · Cited by 80
Metadata
- Authors
- Hock, M., Bless, R., & Zitterbart, M.
- Venue
- 2017 IEEE 25th International Conference on Network Protocols (ICNP)
- Publisher
- IEEE
- Published
- 2017-10
- Pages
- 1-10
- ISSN
- 1092-1648 (ISSN-L)
- OpenAlex
- W2768913804
- Cited by
- 257
- References
- 11
- FWCI
- 22.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experimental evaluation of BBR congestion control. https://app.cochat.ai/papers/10.1109/icnp.2017.8117540
- The paper
- Hock, M., Bless, R., & Zitterbart, M. (2017). Experimental evaluation of BBR congestion control. 2017 IEEE 25th International Conference on Network Protocols (ICNP). https://doi.org/10.1109/icnp.2017.8117540
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.