Cheap Nasty Queueing
draft-morton-tsvwg-cheap-nasty-queueing-01

Document Type Expired Internet-Draft (individual)
Authors Jonathan Morton , Peter G. Heist
Last updated 2020-05-07 (Latest revision 2019-11-04)
Stream (None)
Formats
Expired & archived
plain text html xml htmlized pdfized bibtex
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)
Email authors IPR References Referenced by Nits
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-cheap-nasty-queueing-01.txt

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.

Authors

Jonathan Morton
Peter G. Heist

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