@techreport{morton-tsvwg-codel-approx-fair-01,
    number =    {draft-morton-tsvwg-codel-approx-fair-01},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-morton-tsvwg-codel-approx-fair/01/},
    author =    {Jonathan Morton and Peter G. Heist},
    title =     {{Controlled Delay Approximate Fairness AQM}},
    pagetotal = 7,
    year =      2020,
    month =     mar,
    day =       9,
    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.},
}