{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T15:38:30Z","timestamp":1760888310406,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2008,12,31]],"date-time":"2008-12-31T00:00:00Z","timestamp":1230681600000},"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":[[2008,12,31]]},"abstract":"<jats:p>Buffer sizing has received a lot of attention recently since it is becoming increasingly difficult to use large buffers in highspeed routers. Much of the prior work has concentrated on analyzing the amount of buffering required in core routers assuming that TCP carries all the data traffic. In this paper, we evaluate the amount of buffering required for RCP on a single congested link, while explicitly modeling flow arrivals and departures. Our theoretical analysis and simulations indicate that buffer sizes of about 10% of the bandwidth-delay product are sufficient for RCP to deliver good performance to end-users.<\/jats:p>","DOI":"10.1145\/1496091.1496093","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T14:41:13Z","timestamp":1232462473000},"page":"5-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Buffer sizing results for RCP congestion control under connection arrivals and departures"],"prefix":"10.1145","volume":"39","author":[{"given":"Ashvin","family":"Lakshmikantha","sequence":"first","affiliation":[{"name":"ECE and CSL UIUC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Srikant","sequence":"additional","affiliation":[{"name":"ECE and CSL UIUC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nandita","family":"Dukkipati","sequence":"additional","affiliation":[{"name":"Computer Systems Lab, Stanford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"McKeown","sequence":"additional","affiliation":[{"name":"Computer Systems Lab, Stanford"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolyn","family":"Beck","sequence":"additional","affiliation":[{"name":"IESE and CSL UIUC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,12,31]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"The network simulator: ns-2. Available at http:\/\/www.isi.edu\/nsnam\/ns.  The network simulator: ns-2. Available at http:\/\/www.isi.edu\/nsnam\/ns."},{"key":"e_1_2_1_2_1","unstructured":"Rcp web page 2006. http:\/\/yuba.stanford.edu\/rcp.  Rcp web page 2006. http:\/\/yuba.stanford.edu\/rcp."},{"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\/LCOMM.2007.070076"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7587-7"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633035"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.400663"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111342"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2007.11"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499169_22"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111336"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.18"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.4.731"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070886"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/839292.843119"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"A. J.\n      Ganesh D.\n      Wischik and \n      N.\n      O'Connell\n    . \n      Big\n      Queues volume \n  1838\n   of \n  Lecture notes in Mathematics\n  . \n  Springer-Berlin 2004\n  .  A. J. Ganesh D. Wischik and N. O'Connell. Big Queues volume 1838 of Lecture notes in Mathematics. Springer-Berlin 2004.","DOI":"10.1007\/978-3-540-39889-9"},{"key":"e_1_2_1_17_1","volume-title":"Congestion, synchronization and buffer size in backbone routers","author":"Handley M.","year":"2006","unstructured":"M. Handley and D. Wischik . Congestion, synchronization and buffer size in backbone routers , 2006 . preprint. M. Handley and D. Wischik. Congestion, synchronization and buffer size in backbone routers, 2006. preprint."},{"key":"e_1_2_1_18_1","volume-title":"The ERICA switch algorithm for ABR traffic management in ATM networks","author":"Kalyanaraman S.","year":"1997","unstructured":"S. Kalyanaraman , R. Jain , S. Fahmy , R. Goyal , and B. Vandalore . The ERICA switch algorithm for ABR traffic management in ATM networks , 1997 . http:\/\/www.cis.ohio-state.edu\/~jain\/papers. S. Kalyanaraman, R. Jain, S. Fahmy, R. Goyal, and B. Vandalore. The ERICA switch algorithm for ABR traffic management in ATM networks, 1997. http:\/\/www.cis.ohio-state.edu\/~jain\/papers."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384609.1384615"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.26"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051606000000907"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070885"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.285"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426738"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070884"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496091.1496093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1496091.1496093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:43Z","timestamp":1750250743000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496091.1496093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,31]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12,31]]}},"alternative-id":["10.1145\/1496091.1496093"],"URL":"https:\/\/doi.org\/10.1145\/1496091.1496093","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[2008,12,31]]},"assertion":[{"value":"2008-12-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}