{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T01:12:07Z","timestamp":1791421927958,"version":"4.3.3"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1600266, CNS-1617728"],"award-info":[{"award-number":["CNS-1600266, CNS-1617728"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1145\/3131365.3131368","type":"proceedings-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:40:22Z","timestamp":1510670422000},"page":"290-303","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":121,"title":["Taking a long look at QUIC"],"prefix":"10.1145","author":[{"given":"Arash Molavi","family":"Kakhki","sequence":"first","affiliation":[{"name":"Northeastern University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Jero","sequence":"additional","affiliation":[{"name":"Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Choffnes","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristina","family":"Nita-Rotaru","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Mislove","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Android debug bridge. https:\/\/developer.android.com\/studio\/command-line\/adb.html.  Android debug bridge. https:\/\/developer.android.com\/studio\/command-line\/adb.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Chrome debugging protocol. https:\/\/developer.chrome.com\/devtools\/docs\/debugger-protocol.  Chrome debugging protocol. https:\/\/developer.chrome.com\/devtools\/docs\/debugger-protocol."},{"key":"e_1_3_2_1_3_1","unstructured":"Chromium. https:\/\/www.chromium.org\/Home.  Chromium. https:\/\/www.chromium.org\/Home."},{"key":"e_1_3_2_1_4_1","unstructured":"I. grigorik. deciphering the critical rendering path. https:\/\/calendar.perfplanet.com\/2012\/deciphering-the-critical-rendering-path\/.  I. grigorik. deciphering the critical rendering path. https:\/\/calendar.perfplanet.com\/2012\/deciphering-the-critical-rendering-path\/."},{"key":"e_1_3_2_1_5_1","unstructured":"IETF QUIC WG. https:\/\/github.com\/quicwg.  IETF QUIC WG. https:\/\/github.com\/quicwg."},{"key":"e_1_3_2_1_6_1","unstructured":"Linux network emulation. http:\/\/www.linuxfoundation.org\/collaborate\/workgroups\/networking\/netem.  Linux network emulation. http:\/\/www.linuxfoundation.org\/collaborate\/workgroups\/networking\/netem."},{"key":"e_1_3_2_1_7_1","unstructured":"Linux traffic control. http:\/\/linux.die.net\/man\/8\/tc.  Linux traffic control. http:\/\/linux.die.net\/man\/8\/tc."},{"key":"e_1_3_2_1_8_1","unstructured":"Playing with QUIC. https:\/\/www.chromium.org\/quic\/playing-with-quic.  Playing with QUIC. https:\/\/www.chromium.org\/quic\/playing-with-quic."},{"key":"e_1_3_2_1_9_1","unstructured":"QUIC\n  : A UDP-Based Secure and Reliable Transport for HTTP\/2. https:\/\/tools.ietf.org\/html\/draft-tsvwg-quic-protocol-02.  QUIC: A UDP-Based Secure and Reliable Transport for HTTP\/2. https:\/\/tools.ietf.org\/html\/draft-tsvwg-quic-protocol-02."},{"key":"e_1_3_2_1_10_1","unstructured":"QUIC at 10 000 feet. https:\/\/docs.google.com\/document\/d\/1gY9-YNDNAB1eip-RTPbqphgySwSNSDHLq9D5Bty4FSU.  QUIC at 10 000 feet. https:\/\/docs.google.com\/document\/d\/1gY9-YNDNAB1eip-RTPbqphgySwSNSDHLq9D5Bty4FSU."},{"key":"e_1_3_2_1_11_1","unstructured":"QUIC Loss Recovery And Congestion Control. https:\/\/tools.ietf.org\/html\/draft-tsvwg-quic-loss-recovery-01.  QUIC Loss Recovery And Congestion Control. https:\/\/tools.ietf.org\/html\/draft-tsvwg-quic-loss-recovery-01."},{"key":"e_1_3_2_1_12_1","unstructured":"QUIC Wire Layout Specification. https:\/\/docs.google.com\/document\/d\/1WJvyZflAO2pq77yOLbp9NsGjC1CHetAXV8I0fQe-B_U.  QUIC Wire Layout Specification. https:\/\/docs.google.com\/document\/d\/1WJvyZflAO2pq77yOLbp9NsGjC1CHetAXV8I0fQe-B_U."},{"key":"e_1_3_2_1_13_1","unstructured":"Tcp probe. https:\/\/wiki.linuxfoundation.org\/networking\/tcpprobe.  Tcp probe. https:\/\/wiki.linuxfoundation.org\/networking\/tcpprobe."},{"key":"e_1_3_2_1_14_1","unstructured":"Welch's t-test. https:\/\/en.wikipedia.org\/wiki\/Welch%27s_t-test.  Welch's t-test. https:\/\/en.wikipedia.org\/wiki\/Welch%27s_t-test."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025151"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841749"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695706"},{"key":"e_1_3_2_1_18_1","unstructured":"Chromium Blog. A QUIC update on Google's experimental transport. http:\/\/blog.chromium.org\/2015\/04\/a-quic-update-on-googles-experimental.html April 2015.  Chromium Blog. A QUIC update on Google's experimental transport. http:\/\/blog.chromium.org\/2015\/04\/a-quic-update-on-googles-experimental.html April 2015."},{"key":"e_1_3_2_1_19_1","unstructured":"C. Cimpanu. Google Creates New Algorithm for Handling TCP Traffic Congestion Control. http:\/\/news.softpedia.com\/news\/google-creates-new-algorithm-for-handling-tcp-traffic-congestion-control-508398.shtml September 2016.  C. Cimpanu. Google Creates New Algorithm for Handling TCP Traffic Congestion Control. http:\/\/news.softpedia.com\/news\/google-creates-new-algorithm-for-handling-tcp-traffic-congestion-control-508398.shtml September 2016."},{"key":"e_1_3_2_1_20_1","volume-title":"Evaluation of QUIC on web page performance. Master's thesis","author":"Das S. R.","year":"2014","unstructured":"S. R. Das . Evaluation of QUIC on web page performance. Master's thesis , Massachusetts Institute of Technology , 2014 . S. R. Das. Evaluation of QUIC on web page performance. Master's thesis, Massachusetts Institute of Technology, 2014."},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of USENIX NSDI","author":"Dong M.","year":"2015","unstructured":"M. Dong , Q. Li , D. Zarchy , P. B. Godfrey , and M. Schapira . PCC: Re-architecting congestion control for consistent high performance . In Proc. of USENIX NSDI , 2015 . M. Dong, Q. Li, D. Zarchy, P. B. Godfrey, and M. Schapira. PCC: Re-architecting congestion control for consistent high performance. In Proc. of USENIX NSDI, 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"February","author":"Dukkipati N.","year":"2013","unstructured":"N. Dukkipati , N. Cardwell , Y. Cheng , and M. Mathis . Tail Loss Probe (TLP): An Algorithm for Fast Recovery of Tail Losses. https:\/\/tools.ietf.org\/html\/draft-dukkipati-tcpm-tcp-loss-probe-01 , February 2013 . N. Dukkipati, N. Cardwell, Y. Cheng, and M. Mathis. Tail Loss Probe (TLP): An Algorithm for Fast Recovery of Tail Losses. https:\/\/tools.ietf.org\/html\/draft-dukkipati-tcpm-tcp-loss-probe-01, February 2013."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660308"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.01.014"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813657"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098842"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.21"},{"key":"e_1_3_2_1_28_1","volume-title":"May","author":"Mathis M.","year":"2013","unstructured":"M. Mathis , N. Dukkipati , and Y. Cheng . Proportional rate reduction for TCP. https:\/\/tools.ietf.org\/html\/rfc6937 , May 2013 . M. Mathis, N. Dukkipati, and Y. Cheng. Proportional rate reduction for TCP. https:\/\/tools.ietf.org\/html\/rfc6937, May 2013."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815716"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510788"},{"key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. of USENIX ATC","author":"Netravali R.","year":"2015","unstructured":"R. Netravali , A. Sivaraman , S. Das , A. Goyal , K. Winstein , J. Mickens , and H. Balakrishnan . Mahimahi: Accurate Record-and-replay for HTTP . In Proc. of USENIX ATC , 2015 . R. Netravali, A. Sivaraman, S. Das, A. Goyal, K. Winstein, J. Mickens, and H. Balakrishnan. Mahimahi: Accurate Record-and-replay for HTTP. In Proc. of USENIX ATC, 2015."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742647.2742670"},{"key":"e_1_3_2_1_34_1","volume-title":"August","author":"Odvarko J.","year":"2012","unstructured":"J. Odvarko , A. Jain , and A. Davies . HTTP Archive (HAR) format. https:\/\/dvcs.w3.org\/hg\/webperf\/raw-file\/tip\/specs\/HAR\/Overview.html , August 2012 . J. Odvarko, A. Jain, and A. Davies. HTTP Archive (HAR) format. https:\/\/dvcs.w3.org\/hg\/webperf\/raw-file\/tip\/specs\/HAR\/Overview.html, August 2012."},{"key":"e_1_3_2_1_35_1","unstructured":"I. Swett. QUIC congestion control and loss recovery. https:\/\/docs.google.com\/presentation\/d\/1T9GtMz1CvPpZtmF8g-W7j9XHZBOCp9cu1fW0sMsmpoo.  I. Swett. QUIC congestion control and loss recovery. https:\/\/docs.google.com\/presentation\/d\/1T9GtMz1CvPpZtmF8g-W7j9XHZBOCp9cu1fW0sMsmpoo."},{"key":"e_1_3_2_1_36_1","volume-title":"https:\/\/www.ietf.org\/proceedings\/96\/slides\/slides-96-quic-3.pdf","author":"Swett I.","year":"2016","unstructured":"I. Swett . QUIC Deployment Experience @ Google . https:\/\/www.ietf.org\/proceedings\/96\/slides\/slides-96-quic-3.pdf , 2016 . I. Swett. QUIC Deployment Experience @Google. https:\/\/www.ietf.org\/proceedings\/96\/slides\/slides-96-quic-3.pdf, 2016."},{"key":"e_1_3_2_1_37_1","volume-title":"February","author":"Swett I.","year":"2016","unstructured":"I. Swett . QUIC FEC v1. https:\/\/docs.google.com\/document\/d\/1Hg1SaLEl6T4rEU9j-isovCo8VEjjnuCPTcLNJewj7Nk\/edit , February 2016 . I. Swett. QUIC FEC v1. https:\/\/docs.google.com\/document\/d\/1Hg1SaLEl6T4rEU9j-isovCo8VEjjnuCPTcLNJewj7Nk\/edit, February 2016."},{"key":"e_1_3_2_1_38_1","volume-title":"Analysis of UDP-based reliable transport using network emulation. Master's thesis","author":"Vernersson A.","year":"2015","unstructured":"A. Vernersson . Analysis of UDP-based reliable transport using network emulation. Master's thesis , Lule\u00e5 University of Technology , 2015 . A. Vernersson. Analysis of UDP-based reliable transport using network emulation. Master's thesis, Lule\u00e5 University of Technology, 2015."},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. of USENIX NSDI","author":"Wang X. S.","year":"2014","unstructured":"X. S. Wang , A. Balasubramanian , A. Krishnamurthy , and D. Wetherall . How speedy is SPDY ? In Proc. of USENIX NSDI , 2014 . X. S. Wang, A. Balasubramanian, A. Krishnamurthy, and D. Wetherall. How speedy is SPDY? In Proc. of USENIX NSDI, 2014."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15509-8_20"},{"key":"e_1_3_2_1_41_1","volume-title":"Larry. RR-TCP: A Reordering-Robust TCP with DSACK. In Proceedings of the 11th IEEE International Conference on Network Protocols, ICNP '03","author":"Karp Ming","year":"2003","unstructured":"Zhang, Ming and Karp , Brad and Floyd , Sally and Peterson , Larry. RR-TCP: A Reordering-Robust TCP with DSACK. In Proceedings of the 11th IEEE International Conference on Network Protocols, ICNP '03 , Washington, DC, USA , 2003 . IEEE Computer Society. Zhang, Ming and Karp, Brad and Floyd, Sally and Peterson, Larry. RR-TCP: A Reordering-Robust TCP with DSACK. In Proceedings of the 11th IEEE International Conference on Network Protocols, ICNP '03, Washington, DC, USA, 2003. IEEE Computer Society."}],"event":{"name":"IMC '17: Internet Measurement Conference","location":"London United Kingdom","acronym":"IMC '17","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation","SIGCOMM ACM Special Interest Group on Data Communication","USENIX Assoc USENIX Assoc"]},"container-title":["Proceedings of the 2017 Internet Measurement Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131365.3131368","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3131365.3131368","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3131365.3131368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:40Z","timestamp":1750212820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3131365.3131368"}},"subtitle":["an approach for rigorous evaluation of rapidly evolving transport protocols"],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":41,"alternative-id":["10.1145\/3131365.3131368","10.1145\/3131365"],"URL":"https:\/\/doi.org\/10.1145\/3131365.3131368","relation":{},"subject":[],"published":{"date-parts":[[2017,11]]},"assertion":[{"value":"2017-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}