{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:49:22Z","timestamp":1781275762226,"version":"3.54.1"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Queue"],"published-print":{"date-parts":[[2012,5]]},"abstract":"<jats:p>Nearly three decades after it was first diagnosed, the \"persistently full buffer problem\" recently exposed as part of \"bufferbloat\", is still with us and made increasingly critical by two trends. First, cheap memory and a \"more is better\" mentality have led to the inflation and proliferation of buffers. Second, dynamically varying path characteristics are much more common today and are the norm at the consumer Internet edge. Reasonably sized buffers become extremely oversized when link rates and path delays fall below nominal values.<\/jats:p>","DOI":"10.1145\/2208917.2209336","type":"journal-article","created":{"date-parts":[[2012,5,7]],"date-time":"2012-05-07T18:47:42Z","timestamp":1336416462000},"page":"20-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":192,"title":["Controlling Queue Delay"],"prefix":"10.1145","volume":"10","author":[{"given":"Kathleen","family":"Nichols","sequence":"first","affiliation":[{"name":"Pollere Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Van","family":"Jacobson","sequence":"additional","affiliation":[{"name":"PARC"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,5,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Braden R. et al. 1998. Recommendations on queue management and congestion avoidance inthe Internet. RFC 2309.   Braden R. et al. 1998. Recommendations on queue management and congestion avoidance inthe Internet. RFC 2309.","DOI":"10.17487\/rfc2309"},{"key":"e_1_2_1_2_1","unstructured":"Bufferbloat Project; http:\/\/www.bufferbloat.net.  Bufferbloat Project; http:\/\/www.bufferbloat.net."},{"key":"e_1_2_1_3_1","unstructured":"CeroWrt Project; http:\/\/www.bufferbloat.net\/projects\/cerowrt.  CeroWrt Project; http:\/\/www.bufferbloat.net\/projects\/cerowrt."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298313"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2011.56"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063166.2071893"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52356"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings ofthe Cocoa Beach Internet Engineering Task Force","author":"Jacobson V.","year":"1989"},{"key":"e_1_2_1_10_1","unstructured":"Jacobson V. 1998. Notes on using RED for queue management and congestion avoidance. Talk presented at NANOG 13 (North American Network Operators' Group); ftp:\/\/ftp.ee.lbl.gov\/talks\/vj-nanog-red.pdf.  Jacobson V. 1998. Notes on using RED for queue management and congestion avoidance. Talk presented at NANOG 13 (North American Network Operators' Group); ftp:\/\/ftp.ee.lbl.gov\/talks\/vj-nanog-red.pdf."},{"key":"e_1_2_1_11_1","unstructured":"Jacobson V. 2006. A rant on queues. A talk presented at MIT Lincoln Labs Lexington MA;http:\/\/www.pollere.net\/Pdfdocs\/QrantJul06.pdf.  Jacobson V. 2006. A rant on queues. A talk presented at MIT Lincoln Labs Lexington MA;http:\/\/www.pollere.net\/Pdfdocs\/QrantJul06.pdf."},{"key":"e_1_2_1_12_1","unstructured":"Jacobson V. Nichols K. Poduri K. 1999. RED in a different light; http:\/\/www.cnaf.infn.it\/~ferrari\/papers\/ispn\/red_light_9_30.pdf.  Jacobson V. Nichols K. Poduri K. 1999. RED in a different light; http:\/\/www.cnaf.infn.it\/~ferrari\/papers\/ispn\/red_light_9_30.pdf."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879173"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CHINACOM.2008.4684957"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/99508.99521"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/263932.264023"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Nagle J. 1984. Congestion control in IP\/TCP internetworks. RFC 896; http:\/\/www.ietf.org\/rfc\/rfc896.txt .   Nagle J. 1984. Congestion control in IP\/TCP internetworks. RFC 896; http:\/\/www.ietf.org\/rfc\/rfc896.txt .","DOI":"10.17487\/rfc0896"},{"key":"e_1_2_1_18_1","unstructured":"Network Simulator - ns-2; http:\/\/nsnam.isi.edu\/nsnam\/index.php\/User_Information.  Network Simulator - ns-2; http:\/\/nsnam.isi.edu\/nsnam\/index.php\/User_Information."},{"key":"e_1_2_1_19_1","unstructured":"http:\/\/www.pollere.net\/CoDel.html.  http:\/\/www.pollere.net\/CoDel.html."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198262"},{"key":"e_1_2_1_21_1","unstructured":"Weigle M. C. 2002. Web traffic generation in ns-2 with PackMime-HTTP; http:\/\/www.cs.odu.edu\/~mweigle\/research\/packmime.  Weigle M. C. 2002. Web traffic generation in ns-2 with PackMime-HTTP; http:\/\/www.cs.odu.edu\/~mweigle\/research\/packmime."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801399"}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2208917.2209336","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2208917.2209336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:10Z","timestamp":1750238470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2208917.2209336"}},"subtitle":["A modern AQM is just one piece of the solution to bufferbloat."],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,5]]}},"alternative-id":["10.1145\/2208917.2209336"],"URL":"https:\/\/doi.org\/10.1145\/2208917.2209336","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"value":"1542-7730","type":"print"},{"value":"1542-7749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]},"assertion":[{"value":"2012-05-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}