Subject: [tsvwg] Fwd: New Version Notification for draft-morton-tsvwg-codel-approx-fair-00.txt

From: Jonathan Morton <[email-masked]>
Date: Wed, 19 Feb 2020 20:01:06 +0100

Ahead of tomorrow's interim meeting, here's a small but important snippet of new work, which we hope people will read in time for Vancouver.  We'll at least mention it in passing during the call.

> A new version of I-D, draft-morton-tsvwg-codel-approx-fair-00.txt
> has been successfully submitted by Peter G. Heist and posted to the
> IETF repository.
> 
> Name:		draft-morton-tsvwg-codel-approx-fair
> Revision:	00
> Title:		Controlled Delay Approximate Fairness AQM
> Document date:	2020-02-19
> Group:		Individual Submission
> Pages:		5
> URL:            https://www.ietf.org/internet-drafts/draft-morton-tsvwg-codel-approx-fair-00.txt
> Status:         https://datatracker.ietf.org/doc/draft-morton-tsvwg-codel-approx-fair/
> Htmlized:       https://tools.ietf.org/html/draft-morton-tsvwg-codel-approx-fair-00
> Htmlized:       https://datatracker.ietf.org/doc/html/draft-morton-tsvwg-codel-approx-fair
> 
> 
> 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.

 - Jonathan Morton