{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:09:17Z","timestamp":1773248957626,"version":"3.50.1"},"reference-count":15,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,22]],"date-time":"2022-03-22T00:00:00Z","timestamp":1647907200000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2022,3,22]]},"abstract":"<jats:p>Internet routers have packet buffers which reduce packet loss during times of congestion. Sizing the router buffer correctly is important: if a router buffer is too small, it can cause high packet loss and link under-utilization. If a buffer is too large, packets may have to wait an unnecessarily long time in the buffer during congested periods, often up to hundreds of milliseconds. While an operator can reduce the operational size of a router buffer, the maximum size of a router buffer is decided by the router manufacturer, and the operator typically configures the router to use all the available buffers. Without clear guidance about how big a buffer needs to be, manufacturers tend to oversize buffers and operators tend to configure larger buffers than necessary, leading to increased cost and delay.<\/jats:p>","DOI":"10.1145\/3529113.3529131","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T22:30:42Z","timestamp":1648247442000},"page":"55-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Updating the Theory of Buffer Sizing"],"prefix":"10.1145","volume":"49","author":[{"given":"Bruce","family":"Spang","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serhat","family":"Arslan","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"McKeown","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"V. Jacobson \"Modified TCP congestion avoidance algorithm \" Apr. 1990. [Online]. Available: ftp:\/\/ftp.ee.lbl.gov\/email\/vanj.90apr30.txt  V. Jacobson \"Modified TCP congestion avoidance algorithm \" Apr. 1990. [Online]. Available: ftp:\/\/ftp.ee.lbl.gov\/email\/vanj.90apr30.txt"},{"key":"e_1_2_1_2_1","first-page":"281","volume-title":"ACM","author":"Appenzeller G.","year":"2004","unstructured":"G. Appenzeller , N. McKeown , and I. Keslassy , \" Sizing router buffers,\" in ACM SIGCOMM Computer Communication Review . ACM , Aug. 2004 , pp. 281 -- 292 . [Online]. Available : http:\/\/portal.acm.org\/citation.cfm?doid=1015467.1015499 G. Appenzeller, N. McKeown, and I. Keslassy, \"Sizing router buffers,\" in ACM SIGCOMM Computer Communication Review. ACM, Aug. 2004, pp. 281--292. [Online]. Available: http:\/\/portal.acm.org\/citation.cfm?doid=1015467.1015499"},{"key":"e_1_2_1_3_1","volume-title":"Massachusetts Institute of Technology","author":"Hoe J. C. J. C.-I.","year":"1995","unstructured":"J. C. J. C.-I. Hoe , \"Start-up dynamics of TCP's congestion control and avoidance schemes,\" Thesis , Massachusetts Institute of Technology , 1995 . [Online]. Available : https:\/\/dspace.mit.edu\/handle\/1721.1\/36971 J. C. J. C.-I. Hoe, \"Start-up dynamics of TCP's congestion control and avoidance schemes,\" Thesis, Massachusetts Institute of Technology, 1995. [Online]. Available: https:\/\/dspace.mit.edu\/handle\/1721.1\/36971"},{"key":"e_1_2_1_4_1","unstructured":"J. Semke J. Mahdavi and M. Mathis \"The Rate-Halving Algorithm for TCP Congestion Control.\" [Online]. Available: https:\/\/tools.ietf.org\/html\/draft-mathis-tcpratehalving- 00  J. Semke J. Mahdavi and M. Mathis \"The Rate-Halving Algorithm for TCP Congestion Control.\" [Online]. Available: https:\/\/tools.ietf.org\/html\/draft-mathis-tcpratehalving- 00"},{"key":"e_1_2_1_5_1","first-page":"15","author":"Dukkipati N.","year":"2011","unstructured":"N. Dukkipati , M. Mathis , Y. Cheng , and M. Ghobadi , \"Proportional Rate Reduction for TCP,\" in Internet Measurement Conference , Nov. 2011 , p. 15 . N. Dukkipati, M. Mathis, Y. Cheng, and M. Ghobadi, \"Proportional Rate Reduction for TCP,\" in Internet Measurement Conference, Nov. 2011, p. 15.","journal-title":"\"Proportional Rate Reduction for TCP,\" in Internet Measurement Conference"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400105"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009824"},{"key":"e_1_2_1_8_1","volume-title":"Mar.","author":"Cardwell N.","year":"2019","unstructured":"N. Cardwell , Y. Cheng , S. H. Yeganeh , I. Swett , V. Vasiliev , P. Jha , Y. Seung , M. Mathis , and V. Jacobson , \" BBR v2: A Model-based Congestion Control,\" Prague , Mar. 2019 . [Online]. Available: https:\/\/www.ietf.org\/proceedings\/104\/slides\/slides- 104-iccrg-an-update-on-bbr-00 N. Cardwell, Y. Cheng, S. H. Yeganeh, I. Swett, V. Vasiliev, P. Jha, Y. Seung, M. Mathis, and V. Jacobson, \"BBR v2: A Model-based Congestion Control,\" Prague, Mar. 2019. [Online]. Available: https:\/\/www.ietf.org\/proceedings\/104\/slides\/slides- 104-iccrg-an-update-on-bbr-00"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"B. Spang S. Arslan and N. McKeown \"Updating the theory of buffer sizing \" Performance Evaluation 2021. [Online]. Available: https:\/\/arxiv.org\/abs\/2109.11693  B. Spang S. Arslan and N. McKeown \"Updating the theory of buffer sizing \" Performance Evaluation 2021. [Online]. Available: https:\/\/arxiv.org\/abs\/2109.11693","DOI":"10.1016\/j.peva.2021.102232"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/205511.205520"},{"key":"e_1_2_1_11_1","first-page":"1072","volume-title":"USA: IEEE","author":"Dhamdhere A.","year":"2005","unstructured":"A. Dhamdhere , Hao Jiang , and C. Dovrolis , \" Buffer sizing for congested internet links,\" in Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., vol. 2. Miami, FL , USA: IEEE , 2005 , pp. 1072 -- 1083 . [Online]. Available : http:\/\/ieeexplore.ieee.org\/document\/1498335\/ A. Dhamdhere, Hao Jiang, and C. Dovrolis, \"Buffer sizing for congested internet links,\" in Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., vol. 2. Miami, FL, USA: IEEE, 2005, pp. 1072--1083. [Online]. Available: http:\/\/ieeexplore.ieee.org\/document\/1498335\/"},{"key":"e_1_2_1_12_1","volume-title":"Loss synchronization and router buffer sizing with high-speed versions of TCP,\" in IEEE INFOCOM Workshops","author":"Hassayoun S.","year":"2008","unstructured":"S. Hassayoun and D. Ros , \" Loss synchronization and router buffer sizing with high-speed versions of TCP,\" in IEEE INFOCOM Workshops 2008 , Apr. 2008. S. Hassayoun and D. Ros, \"Loss synchronization and router buffer sizing with high-speed versions of TCP,\" in IEEE INFOCOM Workshops 2008, Apr. 2008."},{"key":"e_1_2_1_13_1","first-page":"1","volume-title":"Jul. 2015","author":"Lautenschlaeger W.","unstructured":"W. Lautenschlaeger and A. Francini , \" Global synchronization protection for bandwidth sharing TCP flows in high-speed links,\" in 2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) , Jul. 2015 , pp. 1 -- 8 . W. Lautenschlaeger and A. Francini, \"Global synchronization protection for bandwidth sharing TCP flows in high-speed links,\" in 2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR), Jul. 2015, pp. 1--8."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3371934.3371936"},{"key":"e_1_2_1_15_1","first-page":"1","author":"Enachescu M.","year":"2006","unstructured":"M. Enachescu , Y. Ganjali , A. Goel , N. McKeown , and T. Roughgarden , \"Routers with Very Small Buffers.\" INFOCOM , pp. 1 -- 11 , 2006 . [Online]. Available: http:\/\/ieeexplore.ieee.org\/document\/4146893\/ M. Enachescu, Y. Ganjali, A. Goel, N. McKeown, and T. Roughgarden, \"Routers with Very Small Buffers.\" INFOCOM, pp. 1--11, 2006. [Online]. Available: http:\/\/ieeexplore.ieee.org\/document\/4146893\/","journal-title":"\"Routers with Very Small Buffers.\" INFOCOM"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529131","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3529113.3529131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:25Z","timestamp":1750182685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3529113.3529131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,22]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3,22]]}},"alternative-id":["10.1145\/3529113.3529131"],"URL":"https:\/\/doi.org\/10.1145\/3529113.3529131","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2022,3,22]]},"assertion":[{"value":"2022-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}