Lightweight Fair Queueing
draft-morton-tsvwg-lightweight-fair-queueing-00

Document Type Expired Internet-Draft (individual)
Last updated 2020-01-03 (latest revision 2019-07-02)
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-lightweight-fair-queueing-00.txt

Abstract

This note presents Lightweight Fair Queueing (LFQ), a fair queueing algorithm with a small code footprint, low memory requirements, no multiply operations, only two physical queues, and only one set of AQM state. LFQ provides throughput fairness, sparse flow prioritization and ordering guarantees, making it suitable for a mixture of traffic flow types.

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.)