BBR Congestion Control
draft-cardwell-iccrg-bbr-congestion-control-00

Document Type Expired Internet-Draft (individual)
Last updated 2018-01-04 (latest revision 2017-07-03)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-cardwell-iccrg-bbr-congestion-control-00.txt

Abstract

This document specifies the BBR congestion control algorithm. BBR uses recent measurements of a transport connection's delivery rate and round-trip time to build an explicit model that includes both the maximum recent bandwidth available to that connection, and its minimum recent round-trip delay. BBR then uses this model to control both how fast it sends data and the maximum amount 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 [draft-ietf-tcpm-cubic], 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"). This algorithm can be implemented in any transport protocol that supports packet-delivery acknowledgment (thus far, open source implementations are available for TCP [RFC793] and QUIC [draft-ietf-quic-transport-00]).

Authors

Neal Cardwell (ncardwell@google.com)
Yuchung Cheng (ycheng@google.com)
Soheil Yeganeh (soheil@google.com)
Van Jacobson (vanj@google.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)