This informational document explains the specification of the queue
protection algorithm used in DOCSIS technology since version 3.1. 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 flows most likely to be responsible. It can
then prevent harm to other traffic in the low latency queue by
ejecting selected packets (or all packets) of these flows. The
document is designed for four types of audience: a) congestion
control designers who need to understand how to keep on the 'good'
side of the algorithm; b) implementers of the algorithm who want to
understand it in more depth; c) designers of algorithms with similar
goals, perhaps for non-DOCSIS scenarios; and d) researchers
interested in evaluating the algorithm.
2024-05-26T21:02:10Z/api/v1/group/group/1027/91125/api/v1/name/intendedstdlevelname/inf/[]draft-briscoe-docsis-q-protectionAdrian Farrel <rfc-ise@rfc-editor.org>32/api/v1/doc/document/draft-briscoe-docsis-q-protection/07/api/v1/person/email/rfc-ise@rfc-editor.org//api/v1/doc/state/1//api/v1/doc/state/110//api/v1/doc/state/115//api/v1/doc/state/150//api/v1/doc/state/25//api/v1/doc/state/73//api/v1/name/streamname/ise//api/v1/submit/submission/105109//api/v1/submit/submission/123200//api/v1/submit/submission/123848//api/v1/submit/submission/124873//api/v1/submit/submission/126117//api/v1/submit/submission/126139//api/v1/submit/submission/126172//api/v1/submit/submission/138571//api/v1/name/doctagname/ref/The DOCSIS(r) Queue Protection Algorithm to Preserve Low Latency/api/v1/name/doctypename/draft/