{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:25:07Z","timestamp":1772022307307,"version":"3.50.1"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T00:00:00Z","timestamp":1160438400000},"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":[[2006,10,10]]},"abstract":"<jats:p>In the past two years, several papers have proposed rules that suggest two to five orders of magnitude reduction in Internet core router buffers. Others present scenarios where buffer sizes need to be significantly increased. So why the different rules? In this paper we briefly compare the different results and proposals, and summarize some recent preliminary experiments to validate the proposals. We'll see that different results apply to different parts of the network, and depend on several assumptions. For example, we believe that buffers can be safely reduced by an order of magnitude in the routers in service provider backbone networks; but it would be premature to reduce them in routers closer to the edge.<\/jats:p>","DOI":"10.1145\/1163593.1163605","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:35:32Z","timestamp":1161210932000},"page":"67-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Update on buffer sizing in internet routers"],"prefix":"10.1145","volume":"36","author":[{"given":"Yashar","family":"Ganjali","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Nick","family":"McKeown","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}]}],"member":"320","published-online":{"date-parts":[[2006,10,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"NetFPGA project. http:\/\/yuba.stanford.edu\/NetFPGA\/.  NetFPGA project. http:\/\/yuba.stanford.edu\/NetFPGA\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832483"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015499"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2006.215714"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874538"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838092"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.503758"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111342"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Fourth ACM Workshop on Hot Topics in Networks (HotNets-IV)","author":"Dukkipati N.","year":"2005","unstructured":"N. Dukkipati , Y. Ganjali , and R. Zhang-Shen . Typical versus worst case design in networking . In Proceedings of the Fourth ACM Workshop on Hot Topics in Networks (HotNets-IV) , College Park, Maryland , November 2005 . N. Dukkipati, Y. Ganjali, and R. Zhang-Shen. Typical versus worst case design in networking. In Proceedings of the Fourth ACM Workshop on Hot Topics in Networks (HotNets-IV), College Park, Maryland, November 2005."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.240"},{"key":"e_1_2_1_11_1","volume-title":"HR06-HPNG-07-30-00","author":"Ganjali Y.","year":"2006","unstructured":"Y. Ganjali and N. McKeown . Experimental study of router buffer sizing. Manuscript. Also available as technical report , HR06-HPNG-07-30-00 , Stanford University , July 2006 . Y. Ganjali and N. McKeown. Experimental study of router buffer sizing. Manuscript. Also available as technical report, HR06-HPNG-07-30-00, Stanford University, July 2006."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/50.736577"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/NUSOD.2004.1345093"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/NGI.2005.1431663"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-6669-x"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/205511.205520"},{"key":"e_1_2_1_17_1","volume-title":"HR06-HPNG-060606","author":"Wang M.","year":"2006","unstructured":"M. Wang and Y. Ganjali . Unifying buffer sizing results through fairness. Manuscript submitted for publicatoin. Also available as technical report , HR06-HPNG-060606 , Stanford University , June 2006 . M. Wang and Y. Ganjali. Unifying buffer sizing results through fairness. Manuscript submitted for publicatoin. Also available as technical report, HR06-HPNG-060606, Stanford University, June 2006."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1163593.1163605","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1163593.1163605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:19:02Z","timestamp":1750263542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1163593.1163605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,10]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10,10]]}},"alternative-id":["10.1145\/1163593.1163605"],"URL":"https:\/\/doi.org\/10.1145\/1163593.1163605","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2006,10,10]]},"assertion":[{"value":"2006-10-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}