- Abrahamsson, M. TCP ACK suppression. IETF AQM mailing list, 2015; https://www.ietf.org/mail-archive/web/aqm/current/msg01480.html.Google Scholar
- Brakmo, L.S., Peterson, L.L. TCP Vegas: End-to-end congestion avoidance on a global Internet. IEEE J. Selected Areas in Communications 13, 8 (1995), 1465--1480. Google ScholarDigital Library
- Chakravorty, R., Cartwright, J., Pratt, I. Practical experience with TCP over GPRS. IEEE GLOBECOM, 2002. Google ScholarCross Ref
- Corbet, J. TSO sizing and the FQ scheduler. LWN.net, 2013; https://lwn.net/Articles/564978/.Google Scholar
- Ericsson. Ericsson Mobility Report (June), 2015; https://www.ericsson.com/res/docs/2015/ericsson-mobility-report-june-2015.pdf.Google Scholar
- ESnet. Application tuning to optimize international astronomy workflow from NERSC to LFI-DPC at INAF-OATs; http://fasterdata.es.net/data-transfer-tools/case-studies/nersc-astronomy/.Google Scholar
- Flach, T. et al. An Internet-wide analysis of traffic policing. SIGCOMM, 2016, 468--482. Google ScholarDigital Library
- Gail, R., Kleinrock, L. An invariant property of computer network power. In Proceedings of the International Conference on Communications 63, 1 (1981),1--63.1.5.Google Scholar
- Gettys, J., Nichols, K. Bufferbloat: Dark buffers in the Internet. acmqueue 9, 11 (2011); http://queue.acm.org/detail.cfm?id=2071893.Google Scholar
- Ha, S., Rhee, I. 2011. Taming the elephants: new TCP slow start. Computer Networks 55, 9 (2011), 2092--2110. Google ScholarDigital Library
- Ha, S., Rhee, I., Xu, L. CUBIC: a new TCP-friendly high-speed TCP variant. ACM SIGOPS Operating Systems Review 42, 5 (2008), 64--74. Google ScholarDigital Library
- Heidergott, B., Olsder, G. J., Van Der Woude, J. Max Plus at Work: Modeling and Analysis of Synchronized Systems: a Course on Max-Plus Algebra and its Applications. Princeton University Press, 2014.Google Scholar
- Jacobson, V. Congestion avoidance and control. ACM SIGCOMM Computer Communication Review 18, 4 (1988): 314--329. Google ScholarDigital Library
- Jaffe, J. Flow control power is nondecentralizable. IEEE Transactions on Communications 29, 9 (1981), 1301--1306. Google ScholarCross Ref
- Jain, S. et al. B4: experience with a globally-deployed software defined WAN. ACM SIGCOMM Computer Communication Review 43, 4 (2013), 3--14. Google ScholarDigital Library
- Kleinrock, L. 1979. Power and deterministic rules of thumb for probabilistic problems in computer communications. In Proceedings of the International Conference on Communications (1979), 43.1.1--43.1.10.Google Scholar
- Mathis, M., Semke, J., Mahdavi, J., Ott, T. The macroscopic behavior of the TCP congestion avoidance algorithm. ACM SIGCOMM Computer Communication Review 27, 3 (1997), 67--82. Google ScholarDigital Library
- Wikipedia. GPRS core network serving GPRS support node; https://en.wikipedia.org/wiki/GPRS_core_network#Serving_GPRS_support_node_.28SGSN.29.Google Scholar
Index Terms
- BBR: congestion-based congestion control
Recommendations
BBR-With Enhanced Fairness (BBR-EFRA): A new enhanced RTT fairness for BBR congestion control algorithm
AbstractTowards the end of 2016, the Google research team proposed and developed a new state-of-the-art TCP congestion control algorithm called Bottleneck Bandwidth and Round-trip propagation time (BBR). When deployed on various Google ...
BBR': an implementation of bottleneck bandwidth and round-trip time congestion control for ns-3
WNS3 '18: Proceedings of the 2018 Workshop on ns-3The 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 ...
On the Use of TCP BBR in Cellular Networks
TCP BBR is a new TCP variant developed at Google, which, as of this year, is fully deployed in Google's internal WANs and used by services such as Google.com and YouTube. In contrast to other commonly used TCP variants, TCP BBR is not loss-based but ...
Comments