{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T08:19:38Z","timestamp":1769069978196,"version":"3.49.0"},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":[[2005,7]]},"abstract":"<jats:p>This article describes how control theory has been used to address the question of how to size the buffers in core Internet routers. Control theory aims to predict whether the is stable, i.e. whether TCP flows are desynchronized. If flows are desynchronized then small buffers are sufficient [14 ]; the theory here shows that small buffers actually promote desynchronization--a virtuous circle.<\/jats:p>","DOI":"10.1145\/1070873.1070885","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T19:28:32Z","timestamp":1131391712000},"page":"79-82","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":111,"title":["Part II"],"prefix":"10.1145","volume":"35","author":[{"given":"Gaurav","family":"Raina","sequence":"first","affiliation":[{"name":"Judge Institute, Cambridge"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"UMass"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damon","family":"Wischik","sequence":"additional","affiliation":[{"name":"UCL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00136-0"},{"key":"e_1_2_1_2_1","volume-title":"University of Cambridge","author":"Bain A.","year":"2003"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005717"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"S. Floyd. HighSpeed TCP for large congestion windows 2003. RFC 3649 Experimental.]]   S. Floyd. HighSpeed TCP for large congestion windows 2003. RFC 3649 Experimental.]]","DOI":"10.17487\/rfc3649"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"C.V. Hollot V. Misra D. Towsley and W.-B. Gong. On designing improved controllers for AQM routers supporting TCP flows. In IEEE Infocom 2001.]]  C.V. Hollot V. Misra D. Towsley and W.-B. Gong. On designing improved controllers for AQM routers supporting TCP flows. In IEEE Infocom 2001.]]","DOI":"10.1109\/TAC.2002.1008360"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control 2003.]]  F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control 2003.]]","DOI":"10.3166\/ejc.9.159-176"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"M.A. Marsan M. Gatetto P. Giaccone E. Leonardi E. Schiattarella and A. Tarello. Using partial differential equations to model TCP mice and elephants in large IP networks. In IEEE Infocom 2004.]]  M.A. Marsan M. Gatetto P. Giaccone E. Leonardi E. Schiattarella and A. Tarello. Using partial differential equations to model TCP mice and elephants in large IP networks. In IEEE Infocom 2004.]]","DOI":"10.1109\/TNET.2005.860102"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/347057.347421"},{"key":"e_1_2_1_10_1","volume-title":"Statistical Laboratory","author":"Raina G.","year":"2005"},{"key":"e_1_2_1_11_1","volume-title":"EuroNGI","author":"Raina G.","year":"2005"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"R. Srikant. The Mathematics of Internet Congestion Control Birkhauser 2004.]]   R. Srikant. The Mathematics of Internet Congestion Control Birkhauser 2004.]]","DOI":"10.1007\/978-0-8176-8216-3"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3182\/20020721-6-ES-1901.00370"},{"key":"e_1_2_1_14_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\/1070873.1070885","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1070873.1070885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:49Z","timestamp":1750262869000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1070873.1070885"}},"subtitle":["control theory for buffer sizing"],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1145\/1070873.1070885"],"URL":"https:\/\/doi.org\/10.1145\/1070873.1070885","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2005,7]]},"assertion":[{"value":"2005-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}