Abstract
The TCP Macroscopic Model will be completely obsolete soon. It was a closed form performance model for Van Jacobson's landmark congestion control algorithms presented at Sigcomm'88. Jacobson88 requires relatively large buffers to function as intended, while Moore's law is making them uneconomical.
BBR-TCP is a break from the past, unconstrained by many of the assumptions and principles defined in Jacobson88. It already out performs Reno and CUBIC TCP over large portions of the Internet, generally without creating queues of the sort needed by earlier congestion control algorithms. It offers the potential to scale better while using less queue buffer space than existing algorithms.
Because BBR-TCP is built on an entirely new set of principles, it has the potential to deprecate many things, including the Macroscopic Model. New research will be required to lay a solid foundation for an Internet built on BBR.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference49 articles.
1. The macroscopic behavior of the TCP congestion avoidance algorithm
2. Congestion avoidance and control
3. Modeling TCP throughput
4. E. Blanton and M. Allman. 2009. TCP congestion control. RFC5681. RFC Editor. 10.17487/RFC5681 E. Blanton and M. Allman. 2009. TCP congestion control. RFC5681. RFC Editor. 10.17487/RFC5681
5. CUBIC
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献