rfc9957v4.txt		rfc9957.txt
	skipping to change at line 14 ¶		skipping to change at line 14 ¶
	Category: Informational G. White		Category: Informational G. White
	ISSN: 2070-1721 CableLabs		ISSN: 2070-1721 CableLabs
	April 2026		April 2026
	The DOCSIS Queue Protection Algorithm to Preserve Low Latency		The DOCSIS Queue Protection Algorithm to Preserve Low Latency
	Abstract		Abstract
	This Informational RFC explains the specification of the queue		This Informational RFC explains the specification of the queue
	protection algorithm used in Data-Over-Cable Service Interface		protection algorithm used in Data-Over-Cable Service Interface
	Specification (DOCSIS) technology since version 3.1. A shared low-		Specification (DOCSIS) technology introduced in version 3.1. A
	latency queue relies on the non-queue-building behaviour of every		shared low-latency queue relies on the non-queue-building behaviour
	traffic flow using it. However, some flows might not take such care,		of every traffic flow using it. However, some flows might not take
	either accidentally or maliciously. If a queue is about to exceed a		such care, either accidentally or maliciously. If a queue is about
	threshold level of delay, the Queue Protection algorithm can rapidly		to exceed a threshold level of delay, the Queue Protection algorithm
	detect the flows most likely to be responsible. It can then prevent		can rapidly detect the flows most likely to be responsible. It can
	harm to other traffic in the low-latency queue by ejecting selected		then prevent harm to other traffic in the low-latency queue by
	packets (or all packets) of these flows. This document is designed		ejecting selected packets (or all packets) of these flows. This
	for four audiences: a) congestion control designers who need to		document is designed for four audiences: a) congestion control
	understand how to keep on the "good" side of the algorithm; b)		designers who need to understand how to keep on the "good" side of
	implementers of the algorithm who want to understand it in more		the algorithm; b) implementers of the algorithm who want to
	depth; c) designers of algorithms with similar goals, perhaps for		understand it in more depth; c) designers of algorithms with similar
	non-DOCSIS scenarios; and d) researchers interested in evaluating the		goals, perhaps for non-DOCSIS scenarios; and d) researchers
	algorithm.		interested in evaluating the algorithm.
	Status of This Memo		Status of This Memo
	This document is not an Internet Standards Track specification; it is		This document is not an Internet Standards Track specification; it is
	published for informational purposes.		published for informational purposes.
	This is a contribution to the RFC Series, independently of any other		This is a contribution to the RFC Series, independently of any other
	RFC stream. The RFC Editor has chosen to publish this document at		RFC stream. The RFC Editor has chosen to publish this document at
	its discretion and makes no statement about its value for		its discretion and makes no statement about its value for
	implementation or deployment. Documents approved for publication by		implementation or deployment. Documents approved for publication by
	skipping to change at line 98 ¶		skipping to change at line 98 ¶
	9. Comments Solicited		9. Comments Solicited
	10. References		10. References
	10.1. Normative References		10.1. Normative References
	10.2. Informative References		10.2. Informative References
	Acknowledgements		Acknowledgements
	Authors' Addresses		Authors' Addresses
	1. Introduction		1. Introduction
	This Informational RFC explains the specification of the queue		This Informational RFC explains the specification of the queue
	protection (QProt) algorithm used in DOCSIS technology since version		protection (QProt) algorithm used in DOCSIS technology introduced in
	3.1 [DOCSIS].		version 3.1 [DOCSIS].
	Although the algorithm is defined in Annex P of [DOCSIS], it relies		Although the algorithm is defined in Annex P of [DOCSIS], it relies
	on cross references to other parts of the set of specifications.		on cross references to other parts of the set of specifications.
	This document pulls all the strands together into one self-contained		This document pulls all the strands together into one self-contained
	document. The core of the document is a similar pseudocode walk-		document. The core of the document is a similar pseudocode walk-
	through to that in the DOCSIS specification, but it also includes		through to that in the DOCSIS specification, but it also includes
	additional material:		additional material:
	i. a brief overview,		i. a brief overview,
End of changes. 2 change blocks.
	16 lines changed or deleted		16 lines changed or added
This html diff was produced by rfcdiff 1.48.