{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:49Z","timestamp":1750306969683,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,21]],"date-time":"2013-11-21T00:00:00Z","timestamp":1384992000000},"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":[],"published-print":{"date-parts":[[2013,11,21]]},"DOI":"10.1145\/2535771.2535775","type":"proceedings-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T19:50:52Z","timestamp":1387569052000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["How to improve your network performance by asking your provider for worse service"],"prefix":"10.1145","author":[{"given":"Radhika","family":"Mittal","sequence":"first","affiliation":[{"name":"UC Berkeley"}]},{"given":"Justine","family":"Sherry","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Sylvia","family":"Ratnasamy","sequence":"additional","affiliation":[{"name":"UC Berkeley"}]},{"given":"Scott","family":"Shenker","sequence":"additional","affiliation":[{"name":"UC Berkeley and ICSI"}]}],"member":"320","published-online":{"date-parts":[[2013,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ns-3. http:\/\/www.nsnam.org.  ns-3. http:\/\/www.nsnam.org."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390254"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2427036.2427041"},{"key":"e_1_3_2_1_4_1","unstructured":"M. Allman S. Floyd and C. Partridge. Increasing TCP's Initial Window. RFC 3390.   M. Allman S. Floyd and C. Partridge. Increasing TCP's Initial Window. RFC 3390."},{"key":"e_1_3_2_1_5_1","unstructured":"E. Blanton M. Allman K. Fall and L. Wang. A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517.   E. Blanton M. Allman K. Fall and L. Wang. A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP. RFC 3517."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111336"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823844.1823848"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2003.1248656"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400097.1400105"},{"key":"e_1_3_2_1_10_1","volume-title":"An approach to alleviate link overload as observed on an ip backbone","author":"Iyer S.","year":"2003","unstructured":"S. Iyer , S. Bhattacharyya , N. Taft , and C. Diot . An approach to alleviate link overload as observed on an ip backbone , 2003 . S. Iyer, S. Bhattacharyya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an ip backbone, 2003."},{"key":"e_1_3_2_1_11_1","volume-title":"TCP Selective Acknowledgment Options. RFC","author":"Mathis M.","year":"2018","unstructured":"M. Mathis , J. Mahdavi , S. Floyd , and A. Romanow . TCP Selective Acknowledgment Options. RFC 2018 . M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP Selective Acknowledgment Options. RFC 2018."},{"key":"e_1_3_2_1_12_1","first-page":"323","volume-title":"NSDI'08","author":"Nedevschi S.","unstructured":"S. Nedevschi , L. Popa , G. Iannaccone , S. Ratnasamy , and D. Wetherall . Reducing network energy consumption via sleeping and rate-adaptation . NSDI'08 , pages 323 -- 336 . USENIX Association. S. Nedevschi, L. Popa, G. Iannaccone, S. Ratnasamy, and D. Wetherall. Reducing network energy consumption via sleeping and rate-adaptation. NSDI'08, pages 323--336. USENIX Association."},{"key":"e_1_3_2_1_13_1","unstructured":"Sally Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582.   Sally Floyd and T. Henderson. The NewReno Modification to TCP's Fast Recovery Algorithm. RFC 2582."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.188"}],"event":{"name":"HotNets-XII: Twelfth ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","CISCO"],"location":"College Park Maryland","acronym":"HotNets-XII"},"container-title":["Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535771.2535775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2535771.2535775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:24Z","timestamp":1750235964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2535771.2535775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,21]]},"references-count":14,"alternative-id":["10.1145\/2535771.2535775","10.1145\/2535771"],"URL":"https:\/\/doi.org\/10.1145\/2535771.2535775","relation":{},"subject":[],"published":{"date-parts":[[2013,11,21]]},"assertion":[{"value":"2013-11-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}