Every time you stream a video or load a page, your computer and the server must decide how fast to send. Too slow wastes the connection. Too fast clogs it, and packets are delayed or dropped. The rule that decides this is called congestion control, and for decades the standard answer was simple: speed up until a packet is lost, then slow down.
A team at Google wrote an article in 2016 arguing that this old idea no longer fits today's networks. When network buffers are large, loss based control fills them, causing long delays called bufferbloat. When buffers are small, it mistakes ordinary drops for congestion and slows down too much. Their answer, BBR, does not wait for loss. It measures the path.
BBR continuously estimates two numbers: the bottleneck bandwidth (BtlBw) and the round-trip propagation time (RTprop). It sends at the bottleneck rate and keeps about one bandwidth-delay product of data in flight. That fills the pipe without filling the buffer, so throughput stays high and delay stays low.
A path is a pipe
Whatever a connection crosses, the paper says, from TCP's point of view it behaves like a single link with the same round-trip time. Two physical facts describe it. RTprop is the round-trip time when nothing is queued. BtlBw is the speed of the slowest link, the bottleneck.
Their product, BtlBw x RTprop, is the bandwidth-delay product (BDP). It is exactly the amount of data that fits in the pipe. With less than a BDP in flight, the link sits partly idle. With more, no extra data gets through. The excess just waits in the bottleneck buffer.
The paper points out that the left edge of the bandwidth-limited region, at exactly one BDP in flight, is the best place to run. Leonard Kleinrock showed in 1979 that this operating point maximizes delivered bandwidth while minimizing delay and loss. Loss-based control sits at the right edge instead, with the buffer full.
