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

Document Type Expired Internet-Draft (individual)
Last updated 2020-05-07 (latest revision 2019-11-04)
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-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 (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.)