{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:15:09Z","timestamp":1783610109250,"version":"3.55.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T00:00:00Z","timestamp":1561334400000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2019,6,24]]},"abstract":"<jats:p>Google's Quick UDP Internet Connections (QUIC) protocol, which implements TCP-like properties at the application layer atop a UDP transport, is now used by the vast majority of Chrome clients accessing Google properties but has no formal state machine specification, limited analysis, and ad-hoc evaluations based on snapshots of the protocol implementation in a small number of environ-merits. Further frustrating attempts to evaluate QUIC is the fact that the protocol is under rapid development, with extensive rewriting of the protocol occurring over the scale of months, making individual studies of the protocol obsolete before publication.<\/jats:p>\n          <jats:p>Given this unique scenario, there is a need for alternative techniques for understanding and evaluating QUIC when compared with previous transport-layer protocols. First, we develop an approach that allows us to conduct analysis across multiple versions of QUIC to understand how code changes impact protocol effectiveness. Next, we instrument the source code to infer QUIC's state machine from execution traces. With this model, we run QUIC in a large number of environments that include desktop and mobile, wired and wireless environments and use the state machine to understand differences in transport-and application-layer performance across multiple versions of QUIC and in different environments. QUIC generally outperforms TCP, but we also identified performance issues related to window sizes, re-ordered packets, and multiplexing large number of small objects; further, we identify that QUIC's performance diminishes on mobile devices and over cellular networks.<\/jats:p>","DOI":"10.1145\/3330336","type":"journal-article","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T12:20:20Z","timestamp":1561465220000},"page":"86-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Taking a long look at QUIC"],"prefix":"10.1145","volume":"62","author":[{"given":"Arash Molavi","family":"Kakhki","sequence":"first","affiliation":[{"name":"ThousandEyes, Boston, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Jero","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Choffnes","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristina","family":"Nita-Rotaru","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Mislove","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,24]]},"reference":[{"key":"e_1_2_1_1_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_2_1_2_1","unstructured":"https:\/\/github.com\/quicwg\/basedrafts\/wiki\/implementations.  https:\/\/github.com\/quicwg\/basedrafts\/wiki\/implementations."},{"key":"e_1_2_1_3_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_2_1_4_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_2_1_5_1","unstructured":"TCP probe. https:\/\/wiki.linuxfoundation.org\/networking\/tcpprobe.  TCP probe. https:\/\/wiki.linuxfoundation.org\/networking\/tcpprobe."},{"key":"e_1_2_1_6_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_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025151"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695706"},{"key":"e_1_2_1_9_1","volume-title":"April","author":"Chromium Blog","year":"2015","unstructured":"Chromium Blog . A QUIC update on Google's experimental transport , April 2015 . http:\/\/blog.chromium.org\/2015\/04\/a-quic-update-on-googles-experimental.html. Chromium Blog. A QUIC update on Google's experimental transport, April 2015. http:\/\/blog.chromium.org\/2015\/04\/a-quic-update-on-googles-experimental.html."},{"key":"e_1_2_1_10_1","volume-title":"September","author":"Cimpanu C.","year":"2016","unstructured":"Cimpanu , C. Google creates new algorithm for handling TCP traffic congestion control , September 2016 . http:\/\/news.softpedia.com\/news\/google-creates-new-algorithm-for-handling-tcp-traffic-congshtml. Cimpanu, C. Google creates new algorithm for handling TCP traffic congestion control, September 2016. http:\/\/news.softpedia.com\/news\/google-creates-new-algorithm-for-handling-tcp-traffic-congshtml."},{"key":"e_1_2_1_11_1","volume-title":"Evaluation of QUIC on Web page performance. Master's thesis","author":"Das S.R.","year":"2014","unstructured":"Das , S.R. Evaluation of QUIC on Web page performance. Master's thesis , Massachusetts Institute of Technology ( 2014 ). Das, S.R. Evaluation of QUIC on Web page performance. Master's thesis, Massachusetts Institute of Technology (2014)."},{"key":"e_1_2_1_12_1","volume-title":"February","author":"Dukkipati N.","year":"2013","unstructured":"Dukkipati , N. , Cardwell , N. , Cheng , Y. , Mathis , M. Tail loss probe (TLP): An algorithm for fast recovery of tail losses , February 2013 . https:\/\/tools.ietf.org\/html\/draft-dukkipati-tcpm-tcp-loss-probe-01. Dukkipati, N., Cardwell, N., Cheng, Y., Mathis, M. Tail loss probe (TLP): An algorithm for fast recovery of tail losses, February 2013. https:\/\/tools.ietf.org\/html\/draft-dukkipati-tcpm-tcp-loss-probe-01."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.01.014"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131365.3131368"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098842"},{"key":"e_1_2_1_16_1","volume-title":"May","author":"Mathis M.","year":"2013","unstructured":"Mathis , M. , Dukkipati , N. , Cheng , Y. Proportional rate reduction for TCP , May 2013 . https:\/\/tools.ietf.org\/html\/rfc6937. Mathis, M., Dukkipati, N., Cheng, Y. Proportional rate reduction for TCP, May 2013. https:\/\/tools.ietf.org\/html\/rfc6937."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510788"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2742647.2742670"},{"key":"e_1_2_1_19_1","unstructured":"Odvarko J. Jain A. Davies A. HTTP Archive (HAR) format August 2012. https:\/\/dvcs.w3.org\/hg\/webperf\/raw-file\/tip\/specs\/HAR\/Overview.html.  Odvarko J. Jain A. Davies A. HTTP Archive (HAR) format August 2012. https:\/\/dvcs.w3.org\/hg\/webperf\/raw-file\/tip\/specs\/HAR\/Overview.html."},{"key":"e_1_2_1_20_1","unstructured":"Swett I. QUIC congestion control and loss recovery. https:\/\/docs.google.com\/presentation\/d\/1T9GtMz1CvPpZtmF8g-W7j9XHZBOCp9cu1fW0sMsmpoo.  Swett I. QUIC congestion control and loss recovery. https:\/\/docs.google.com\/presentation\/d\/1T9GtMz1CvPpZtmF8g-W7j9XHZBOCp9cu1fW0sMsmpoo."},{"key":"e_1_2_1_21_1","volume-title":"QUIC deployment experience \"Google","author":"Swett I.","year":"2016","unstructured":"Swett , I. QUIC deployment experience \"Google , 2016 . https:\/\/www.ietf.org\/proceedings\/96\/slides\/slides-96-quic-3.pdf. Swett, I. QUIC deployment experience \"Google, 2016. https:\/\/www.ietf.org\/proceedings\/96\/slides\/slides-96-quic-3.pdf."},{"key":"e_1_2_1_22_1","volume-title":"February","author":"Swett I.","year":"2016","unstructured":"Swett , I. QUIC FEC v1 , February 2016 . https:\/\/docs.google.com\/document\/d\/1Hg1SaLEl6T4rEU9j-isovCo8VEjjnuCPTcLNJewj7Nk\/edit. Swett, I. QUIC FEC v1, February 2016. https:\/\/docs.google.com\/document\/d\/1Hg1SaLEl6T4rEU9j-isovCo8VEjjnuCPTcLNJewj7Nk\/edit."},{"key":"e_1_2_1_23_1","volume-title":"Proc. of USENIX NSDI","author":"Wang X.S.","year":"2014","unstructured":"Wang , X.S. , Balasubramanian , A. , Krishnamurthy , A. , Wetherall , D. How speedy is SPDY? In Proc. of USENIX NSDI ( 2014 ). Wang, X.S., Balasubramanian, A., Krishnamurthy, A., Wetherall, D. How speedy is SPDY? In Proc. of USENIX NSDI (2014)."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 11th IEEE International Conference on Network Protocols, ICNP '03","author":"Zhang M.","year":"2003","unstructured":"Zhang , M. , Karp , B. , Floyd , S. , Peterson , L. 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, M., Karp, B., Floyd, S., Peterson, L. 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."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330336","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3330336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:05Z","timestamp":1750204445000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3330336"}},"subtitle":["an approach for rigorous evaluation of rapidly evolving transport protocols"],"short-title":[],"issued":{"date-parts":[[2019,6,24]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,6,24]]}},"alternative-id":["10.1145\/3330336"],"URL":"https:\/\/doi.org\/10.1145\/3330336","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,24]]},"assertion":[{"value":"2019-06-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}