Browse Prior Art Database

On Queuing, Marking, and Dropping (RFC7806) Disclosure Number: IPCOM000245866D
Original Publication Date: 2016-Apr-01
Included in the Prior Art Database: 2016-Apr-14
Document File: 32 page(s) / 38K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

F. Baker: AUTHOR [+1]


In the discussion of Active Queue Management (AQM), there has been discussion of the coupling of queue management algorithms such as Stochastic Fairness Queuing [SFQ], Virtual Clock [VirtualClock], or Deficit Round Robin [DRR] with mark/drop algorithms such as Controlled Delay (CoDel) [DELAY-AQM] or Proportional Integral controller Enhanced (PIE) [AQM-PIE]. In the interest of clarifying the discussion, we document possible implementation approaches to that and analyze the possible effects and side effects. The language and model derive from the Architecture for Differentiated Services [RFC2475].

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 7% of the total text.

Internet Engineering Task Force (IETF)                          F. Baker Request for Comments: 7806                                        R. Pan Category: Informational                                    Cisco Systems ISSN: 2070-1721                                               April 2016

                    On Queuing, Marking, and Dropping


   This note discusses queuing and marking/dropping algorithms.  While    these algorithms may be implemented in a coupled manner, this note    argues that specifications, measurements, and comparisons should    decouple the different algorithms and their contributions to system    behavior.

Status of This Memo

   This document is not an Internet Standards Track specification; it is    published for informational purposes.

   This document is a product of the Internet Engineering Task Force    (IETF).  It represents the consensus of the IETF community.  It has    received public review and has been approved for publication by the    Internet Engineering Steering Group (IESG).  Not all documents    approved by the IESG are a candidate for any level of Internet    Standard; see Section 2 of RFC 5741.

   Information about the current status of this document, any errata,    and how to provide feedback on it may be obtained at

Copyright Notice

   Copyright (c) 2016 IETF Trust and the persons identified as the    document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal    Provisions Relating to IETF Documents    ( in effect on the date of    publication of this document.  Please review these documents    carefully, as they describe your rights and restrictions with respect    to this document.  Code Components extracted from this document must    include Simplified BSD License text as described in Section 4.e of    the Trust Legal Provisions and are provided without warranty as    described in the Simplified BSD License.

Baker & Pan                   Informational                     [Page 1]
 RFC 7806            On Queuing, Marking, and Dropping         April 2016

 Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2

   2.  Fair Queuing: Algorithms and History  . . . . . . . . . . . .   3

     2.1.  Generalized Processor Sharing . . . . . . . . . . . . . .   3

       2.1.1.  GPS Comparisons: Transmission Quanta  . . . . . . . .   4

       2.1.2.  GPS Comparisons: Flow Definition  . . . . . . . . . .   4

       2.1.3.  GPS Comparisons: Unit of Measurement  . . . . . . . .   5

     2.2. ...