{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:08:29Z","timestamp":1773248909846,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T00:00:00Z","timestamp":1326067200000},"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":[[2013,1,9]]},"abstract":"<jats:p>\n            While there has been much buzz in the community about the large depth of queues throughout the Internet---the so-called \"bufferbloat\" problem---there has been little empirical understanding of the scope of the phenomenon. Yet, the supposed problem is being used as input to engineering decisions about the evolution of protocols. While we know from wide scale measurements that bufferbloat\n            <jats:italic>can<\/jats:italic>\n            happen, we have no empirically-based understanding of how often bufferbloat\n            <jats:italic>does<\/jats:italic>\n            happen. In this paper we use passive measurements to assess the bufferbloat phenomena.\n          <\/jats:p>","DOI":"10.1145\/2427036.2427041","type":"journal-article","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T15:42:48Z","timestamp":1357918968000},"page":"30-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Comments on bufferbloat"],"prefix":"10.1145","volume":"43","author":[{"given":"Mark","family":"Allman","sequence":"first","affiliation":[{"name":"International Computer Science Institute, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Case Connection Zone. http:\/\/caseconnectionzone.org\/.  Case Connection Zone. http:\/\/caseconnectionzone.org\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3465"},{"key":"e_1_2_1_3_1","first-page":"5681","author":"Allman M.","year":"2009","unstructured":"M. Allman , V. Paxson , and E. Blanton . TCP Congestion Control , Sept. 2009 . RFC 5681 . M. Allman, V. Paxson, and E. Blanton. TCP Congestion Control, Sept. 2009. RFC 5681.","journal-title":"TCP Congestion Control"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068833"},{"key":"e_1_2_1_5_1","volume-title":"Feb.","author":"Chu J.","year":"2012","unstructured":"J. Chu , N. Dukkipati , Y. Cheng , and M. Mathis . Increasing TCP's Initial Window , Feb. 2012 . Internet-Draft draft-ietf-tcpm-initcwnd-03.txt (work in progress). J. Chu, N. Dukkipati, Y. Cheng, and M. Mathis. Increasing TCP's Initial Window, Feb. 2012. Internet-Draft draft-ietf-tcpm-initcwnd-03.txt (work in progress)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.650143"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2011.56"},{"key":"e_1_2_1_9_1","volume-title":"Aug.","author":"Gettys J.","year":"2011","unstructured":"J. Gettys . IW10 Considered Harmful , Aug. 2011 . Internet-Draft draft-gettys-iw10-considered-harmful-00.txt (work in progress). J. Gettys. IW10 Considered Harmful, Aug. 2011. Internet-Draft draft-gettys-iw10-considered-harmful-00.txt (work in progress)."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063166.2071893"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398800"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52356"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1323"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398810"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/55482.55484"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879173"},{"key":"e_1_2_1_17_1","volume-title":"Bro tcp anomaly script","author":"LaCurts K.","year":"2012","unstructured":"K. LaCurts . Bro tcp anomaly script , 2012 . K. LaCurts. Bro tcp anomaly script, 2012."},{"key":"e_1_2_1_18_1","unstructured":"L. MaxMind. City-level geoip database. http:\/\/www.maxmind.com\/.  L. MaxMind. City-level geoip database. http:\/\/www.maxmind.com\/."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/248156.248160"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"e_1_2_1_21_1","first-page":"6298","author":"Paxson V.","year":"2011","unstructured":"V. Paxson , M. Allman , H. J. Chu , and M. Sargent . Computing TCP's Retransmission Timeout , June 2011 . RFC 6298 . V. Paxson, M. Allman, H. J. Chu, and M. Sargent. Computing TCP's Retransmission Timeout, June 2011. RFC 6298.","journal-title":"Computing TCP's Retransmission Timeout"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2481"},{"key":"e_1_2_1_24_1","unstructured":"The Spamhaus Project - PBL. http:\/\/www.spamhaus.org\/pbl\/.  The Spamhaus Project - PBL. http:\/\/www.spamhaus.org\/pbl\/."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2427036.2427041","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2427036.2427041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:49:00Z","timestamp":1750236540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2427036.2427041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,9]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1,9]]}},"alternative-id":["10.1145\/2427036.2427041"],"URL":"https:\/\/doi.org\/10.1145\/2427036.2427041","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,9]]},"assertion":[{"value":"2012-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}