Mark Claypool, Feng Li, and Jae Chung
The dominant Internet protocol, TCP, does not work as well as it could over the wide-variety of networks facing today's applications. Bottleneck Bandwidth and Round-trip time (BBR) congestion control has been proposed as an improvement, with the promise of higher throughputs and lower delays as compared to other TCP congestion control algorithms. While BBR has been implemented for Linux, unfortunately, there is not yet an implementation for ns-3, a powerful, flexible and popular simulator used for network research. This paper presents BBR', an implementation of BBR for ns-3. BBR' extends ns-3 in a fashion similar to other TCP congestion control algorithms, re-using existing interconnection mechanisms and making BBR' extensible. Preliminary validation shows BBR' behaves and performs similarly to BBR, and preliminary performance evaluation shows BBR' has similar throughputs but significantly lower round-trip times than CUBIC in some wired and 4G LTE wireless scenarios.
Mark Claypool, Jae Chung, and Feng Li. BBR' - An Implementation of Bottleneck Bandwidth and Round-trip Time Congestion Control for ns-3, Technical Report WPI-CS-TR-18-01, Computer Science Department, Worcester Polytechnic Institute, January 2018. Online at: ftp://ftp.cs.wpi.edu/pub/techreports/pdf/18-01.pdf
Feng Li, Jae Won Chung, Xiaoxiao Jiang, and Mark Claypool. TCP CUBIC versus BBR on the Highway, In Proceedings of the Passive and Active Measurement Conference (PAM), Berlin, Germany, March 2018. Online at: http://www.cs.wpi.edu/~claypool/papers/driving-bbr/