Subject: [tsvwg] Fwd: New Version Notification for draft-morton-tsvwg-cheap-nasty-queueing-01.txt

From: Jonathan Morton <[email-masked]>
Date: Tue, 5 Nov 2019 00:21:40 +0200

> A new version of I-D, draft-morton-tsvwg-cheap-nasty-queueing-01.txt
> has been successfully submitted by Rodney W. Grimes and posted to the
> IETF repository.
> 
> Name:		draft-morton-tsvwg-cheap-nasty-queueing
> Revision:	01
> Title:		Cheap Nasty Queueing
> Document date:	2019-11-04
> Group:		Individual Submission
> Pages:		9
> URL:            https://www.ietf.org/internet-drafts/draft-morton-tsvwg-cheap-nasty-queueing-01.txt
> Status:         https://datatracker.ietf.org/doc/draft-morton-tsvwg-cheap-nasty-queueing/
> Htmlized:       https://tools.ietf.org/html/draft-morton-tsvwg-cheap-nasty-queueing-01
> Htmlized:       https://datatracker.ietf.org/doc/html/draft-morton-tsvwg-cheap-nasty-queueing
> Diff:           https://www.ietf.org/rfcdiff?url2=draft-morton-tsvwg-cheap-nasty-queueing-01
> 
> Abstract:
>   This note presents Cheap Nasty Queueing (CNQ), a queueing algorithm
>   intended as a bare-minimum functionality standard for hardware
>   implementations.  It provides stateless or single-instance AQM and
>   basic sparse-flow prioritisation.

The changes in this version aim to clarify some technical aspects of this algorithm.  A practical implementation is currently in testing.

 - Jonathan Morton