This document specifies the BBR congestion control algorithm. BBR
("Bottleneck Bandwidth and Round-trip propagation time") uses recent
measurements of a transport connection's delivery rate, round-trip
time, and packet loss rate to build an explicit model of the network
path. BBR then uses this model to control both how fast it sends
data and the maximum volume of data it allows in flight in the
network at any time. Relative to loss-based congestion control
algorithms such as Reno [RFC5681] or CUBIC [RFC8312], BBR offers
substantially higher throughput for bottlenecks with shallow buffers
or random losses, and substantially lower queueing delays for
bottlenecks with deep buffers (avoiding "bufferbloat"). BBR can be
implemented in any transport protocol that supports packet-delivery
acknowledgment. Thus far, open source implementations are available
for TCP [RFC793] and QUIC [RFC9000]. This document specifies version
2 of the BBR algorithm, also sometimes referred to as BBRv2 or bbr2.
2022-09-08T20:12:10Z/api/v1/group/group/1027/78222[]draft-cardwell-iccrg-bbr-congestion-control66/api/v1/doc/document/draft-cardwell-iccrg-bbr-congestion-control/02/api/v1/doc/state/4//api/v1/doc/state/150//api/v1/submit/submission/88143//api/v1/submit/submission/122595//api/v1/submit/submission/125094/BBR Congestion Control/api/v1/name/doctypename/draft/