URL: https://doi.org/10.1145/3355369.3355604
Bibtex Entry:
@inproceedings{2019-Ware-imc, author = “Ware, Ranysha and Mukerjee, Matthew K. and Seshan, Srinivasan and Sherry, Justine”, title = “Modeling BBR’s Interactions with Loss-Based Congestion Control”, year = “2019”, month = “October”, isbn = “9781450369480”, publisher = “Association for Computing Machinery”, address = “New York, NY, USA”, url = “https://doi.org/10.1145/3355369.3355604”, doi = “10.1145/3355369.3355604”, abstract = “BBR is a new congestion control algorithm (CCA) deployed for Chromium QUIC and the Linux kernel. As the default CCA for YouTube (which commands 11+\% of Internet traffic), BBR has rapidly become a major player in Internet congestion control. BBR’s fairness or friendliness to other connections has recently come under scrutiny as measurements from multiple research groups have shown undesirable outcomes when BBR competes with traditional CCAs. One such outcome is a fixed, 40\% proportion of link capacity consumed by a single BBR flow when competing with as many as 16 loss-based algorithms like Cubic or Reno. In this short paper, we provide the first model capturing BBR’s behavior in competition with loss-based CCAs. Our model is coupled with practical experiments to validate its implications. The key lesson is this: under competition, BBR becomes window-limited by its ‘in-flight cap’ which then determines BBR’s bandwidth consumption. By modeling the value of BBR’s in-flight cap under varying network conditions, we can predict BBR’s throughput when competing against Cubic flows with a median error of 5\%, and against Reno with a median of 8\%.”, booktitle = “ACM Internet Measurement Conference (IMC)”, pages = “137–143”, numpages = “7”, location = “Amsterdam, Netherlands”, series = “IMC ‘19” }