{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T11:56:58Z","timestamp":1769860618394,"version":"3.49.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2019,11,8]]},"abstract":"<jats:p>\n            The queueing delay faced by a packet is arguably the largest source of uncertainty during its journey. It therefore seems crucial that we understand how big the buffers should be in Internet routers. Our 2004 Sigcomm paper revisited the existing rule of thumb that a buffer should hold one bandwidth-delay product of packets. We claimed that for long-lived TCP flows, it could be reduced by \u221a\n            <jats:italic>N<\/jats:italic>\n            , where\n            <jats:italic>N<\/jats:italic>\n            is the number of active flows, potentially reducing the required buffers by well over 90% in Internet backbone routers. One might reasonably expect that such a result, which supports cheaper routers with smaller buffers, would be embraced by the ISP community. In this paper we revisit the result 15 years later, and explain where it has succeeded and failed to affect how buffers are sized.\n          <\/jats:p>","DOI":"10.1145\/3371934.3371957","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T20:27:58Z","timestamp":1573244878000},"page":"69-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Sizing router buffers (redux)"],"prefix":"10.1145","volume":"49","author":[{"given":"Nick","family":"McKeown","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Guido","family":"Appenzeller","sequence":"additional","affiliation":[{"name":"Yubico, Inc."}]},{"given":"Isaac","family":"Keslassy","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]}],"member":"320","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015499"},{"key":"e_1_2_1_3_1","volume-title":"Buffer sizing in Internet routers. https:\/\/youtu.be\/ykga6N_x27w?t=170","author":"Beheshti N.","year":"2011","unstructured":"Beheshti , N. Buffer sizing in Internet routers. https:\/\/youtu.be\/ykga6N_x27w?t=170 , 2011 . Beheshti, N. Buffer sizing in Internet routers. https:\/\/youtu.be\/ykga6N_x27w?t=170, 2011."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2048924"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452545"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTQE.2010.2077673"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498335"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070886"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2010.OThP3"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230545"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_2_1_13_1","volume-title":"Dec. 2--3. https:\/\/buffer-workshop.stanford.edu\/","author":"McKeown N.","year":"2019","unstructured":"McKeown , N. , and Diot , C . Buffer sizing workshop , Dec. 2--3. https:\/\/buffer-workshop.stanford.edu\/ , 2019 . McKeown, N., and Diot, C. Buffer sizing workshop, Dec. 2--3. https:\/\/buffer-workshop.stanford.edu\/, 2019."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow","author":"Naous J.","year":"2008","unstructured":"Naous , J. , Gibb , G. , Bolouki , S. , and McKeown , N. Net FPGA : Reusable router architecture for experimental research . In Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow ( 2008 ), PRESTO '08. Naous, J., Gibb, G., Bolouki, S., and McKeown, N. NetFPGA: Reusable router architecture for experimental research. In Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow (2008), PRESTO '08."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2208917.2209336"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070885"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2009.05.005"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787508"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/205511.205520"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198255.1198262"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371957","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3371934.3371957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:19Z","timestamp":1750203859000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3371934.3371957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,11,8]]}},"alternative-id":["10.1145\/3371934.3371957"],"URL":"https:\/\/doi.org\/10.1145\/3371934.3371957","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"2019-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}