Queue Protection to Preserve Low Latency

Document Type Expired Internet-Draft (individual)
Authors Bob Briscoe  , Greg White 
Last updated 2020-08-16 (latest revision 2019-07-08)
Stream (None)
Intended RFC status Informational
Expired & archived
pdf 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 Adrian Farrel <rfc-ise@rfc-editor.org>

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


This informational document defines and explains the specification of the queue protection algorithm used in DOCSIS 3.1. It is believed this algorithm will be useful in scenarios other than DOCSIS. A shared low latency queue relies on the non-queue-building behaviour of every traffic flow using it. However, some flows might not take such care, either accidentally or maliciously. If a queue is about to exceed a threshold level of delay, the queue protection algorithm can rapidly detect the flow(s) most likely to be responsible. It can then prevent selected packets of these flows (or whole flows) from harming the queuing delay of other traffic in the low latency queue.


Bob Briscoe (ietf@bobbriscoe.net)
Greg White (g.white@cablelabs.com)

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