<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.nichols-tsvwg-codel" target="https://datatracker.ietf.org/doc/html/draft-nichols-tsvwg-codel-01">
   <front>
      <title>Controlled Delay Active Queue Management</title>
      <author initials="K." surname="Nichols" fullname="Kathleen Nichols">
         </author>
      <author initials="V." surname="Jacobson" fullname="Van Jacobson">
         </author>
      <date month="February" day="25" year="2013" />
      <abstract>
	 <t>   The &quot;persistently full buffer&quot; problem has been discussed in the
   IETF community since the early 80&#x27;s [RFC896]. The IRTF&#x27;s End-to-End
   Working Group called for the deployment of active queue management
   to solve the problem in 1998 [RFC2309]. Despite the awareness and
   recommendations, the &quot;full buffer&quot; problem has not gone away, but on
   the contrary has become worse as buffers have grown in size and
   proliferated and today&#x27;s networks proved intractable for available
   AQM approaches. The overall problem is presently known as
   &quot;bufferbloat&quot;[TSVBB2011, BB2011] and has become increasingly
   important, particularly at the consumer edge.
   This document describes a recently developed AQM, Controlled Delay
   (CoDel) algorithm, which was designed to work in modern networking
   environments and can be deployed as a major part of the solution to
   bufferbloat [CODEL2012]. The goal of the CoDel work is to provide a
   solution with cost-effective implementation that is particularly
   well-suited to the consumer edge.

	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-nichols-tsvwg-codel-01" />
   
</reference>
