Controlled Delay Approximate Fairness AQM
draft-morton-tsvwg-codel-approx-fair-01

Document Type Expired Internet-Draft (individual)
Last updated 2020-09-10 (latest revision 2020-03-09)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized 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-morton-tsvwg-codel-approx-fair-01.txt

Abstract

This note presents CodelAF, or Controlled Delay Approximate Fairness in full, as an alternative to single-queue AQM or Fair Queue implementations in the low-cost or high-speed network hardware spaces. It builds on the seminal work in Codel [RFC8289], and guides multiple competing flows towards similar throughputs by differential congestion signalling, whilst requiring only a single FIFO queue. It may also be combined with CNQ [I-D.morton-tsvwg-cheap-nasty-queueing] to provide a latency optimisation for sparse flows.

Authors

Jonathan Morton (chromatix99@gmail.com)
Peter Heist (pete@heistp.net)

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