{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:12Z","timestamp":1750220352723,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T00:00:00Z","timestamp":1635984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100016682","name":"VMware","doi-asserted-by":"publisher","award":["Systems Research Award"],"award-info":[{"award-number":["Systems Research Award"]}],"id":[{"id":"10.13039\/100016682","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["ANI 045917, UIDB\/50021\/2020 and a CMU Portugal Dual Degree PhD scholarship"],"award-info":[{"award-number":["ANI 045917, UIDB\/50021\/2020 and a CMU Portugal Dual Degree PhD scholarship"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1762363,1850384"],"award-info":[{"award-number":["CCF-1762363,1850384"]}],"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":[[2021,11,10]]},"DOI":"10.1145\/3484266.3487381","type":"proceedings-article","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:31:15Z","timestamp":1636065075000},"page":"132-139","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Counterfeiting Congestion Control Algorithms"],"prefix":"10.1145","author":[{"given":"Margarida","family":"Ferreira","sequence":"first","affiliation":[{"name":"Carnegie Mellon University and INESC-ID\/IST Universidade de Lisboa"}]},{"given":"Akshay","family":"Narayan","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[{"name":"INESC-ID\/IST Universidade de Lisboa"}]},{"given":"Ruben","family":"Martins","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Justine","family":"Sherry","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"320","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Internet: A Game-Theoretic Analysis of TCP. In SIGCOMM. 1","author":"Akella A.","year":"2002","unstructured":"A. Akella , S. Seshan , R. Karp , S. Shenker , and C. Papadimitriou . 2002 . Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP. In SIGCOMM. 1 A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou. 2002. Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP. In SIGCOMM. 1"},{"key":"e_1_3_2_1_2_1","volume-title":"Search-Based Program Synthesis. CACM 61, 12","author":"Alur Rajeev","year":"2018","unstructured":"Rajeev Alur , Rishabh Singh , Dana Fisman , and Armando Solar-Lezama . 2018. Search-Based Program Synthesis. CACM 61, 12 ( 2018 ). 1, 3.1 Rajeev Alur, Rishabh Singh, Dana Fisman, and Armando Solar-Lezama. 2018. Search-Based Program Synthesis. CACM 61, 12 (2018). 1, 3.1"},{"key":"e_1_3_2_1_3_1","first-page":"2","article-title":"Formally Verifying Congestion Control Performance","volume":"1","author":"Arun Venkat","year":"2021","unstructured":"Venkat Arun , Mina Arashloo , Ahmed Saeed , Mohammad Alizadeh , and Hari Balakrishnan . 2021 . Formally Verifying Congestion Control Performance . In SIGCOMM. 1 , 2 Venkat Arun, Mina Arashloo, Ahmed Saeed, Mohammad Alizadeh, and Hari Balakrishnan. 2021. Formally Verifying Congestion Control Performance. In SIGCOMM. 1, 2","journal-title":"SIGCOMM."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232755.3232783"},{"key":"e_1_3_2_1_5_1","volume-title":"Srinivasan Seshan, and Justine Sherry.","author":"Athapathu Rukshani","year":"2020","unstructured":"Rukshani Athapathu , Ranysha Ware , Aditya Abraham Philip , Srinivasan Seshan, and Justine Sherry. 2020 . Prudentia : Measuring Congestion Control Harm on the Internet. In SIGCOMM N2Women Workshop . 1, 2.1 Rukshani Athapathu, Ranysha Ware, Aditya Abraham Philip, Srinivasan Seshan, and Justine Sherry. 2020. Prudentia: Measuring Congestion Control Harm on the Internet. In SIGCOMM N2Women Workshop. 1, 2.1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2007.070076"},{"key":"e_1_3_2_1_7_1","first-page":"3","article-title":"DeepCoder: Learning to Write Programs","volume":"1","author":"Balog Matej","year":"2017","unstructured":"Matej Balog , Alexander L. Gaunt , Marc Brockschmidt , Sebastian Nowozin , and Daniel Tarlow . 2017 . DeepCoder: Learning to Write Programs . In ICLR (Poster). 1 , 3 .1 Matej Balog, Alexander L. Gaunt, Marc Brockschmidt, Sebastian Nowozin, and Daniel Tarlow. 2017. DeepCoder: Learning to Write Programs. In ICLR (Poster). 1, 3.1","journal-title":"ICLR (Poster)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Nikolaj Bj\u00f8rner Nikolai Tillmann and Andrei Voronkov. 2009. Path Feasibility Analysis for String-Manipulating Programs. In TACAS. 3.2  Nikolaj Bj\u00f8rner Nikolai Tillmann and Andrei Voronkov. 2009. Path Feasibility Analysis for String-Manipulating Programs. In TACAS. 3.2","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"e_1_3_2_1_9_1","unstructured":"Neal Cardwell. 2020. BBR Update. https:\/\/datatracker.ietf.org\/meeting\/109\/materials\/slides-109-iccrg-update-on-bbrv2-00. (2020). 1 2  Neal Cardwell. 2020. BBR Update. https:\/\/datatracker.ietf.org\/meeting\/109\/materials\/slides-109-iccrg-update-on-bbrv2-00. (2020). 1 2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3028687.3028689"},{"key":"#cr-split#-e_1_3_2_1_11_1.1","doi-asserted-by":"crossref","unstructured":"Haoxian Chen Anduo Wang and Boon Thau Loo. 2018. Towards Example-Guided Network Synthesis. In APNet. https:\/\/doi.org\/10.1145\/3232565.3234462 3.1 10.1145\/3232565.3234462","DOI":"10.1145\/3232565.3234462"},{"key":"#cr-split#-e_1_3_2_1_11_1.2","doi-asserted-by":"crossref","unstructured":"Haoxian Chen Anduo Wang and Boon Thau Loo. 2018. Towards Example-Guided Network Synthesis. In APNet. https:\/\/doi.org\/10.1145\/3232565.3234462 3.1","DOI":"10.1145\/3232565.3234462"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Qiaochu Chen Xinyu Wang Xi Ye Greg Durrett and Isil Dillig. 2020. Multi-Modal Synthesis of Regular Expressions. In PLDI. 3.1  Qiaochu Chen Xinyu Wang Xi Ye Greg Durrett and Isil Dillig. 2020. Multi-Modal Synthesis of Regular Expressions. In PLDI. 3.1","DOI":"10.1145\/3385412.3385988"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0169-7552(89)90019-6"},{"volume-title":"Understanding Linux Network Internals","author":"Benvenuti Christian","key":"e_1_3_2_1_14_1","unstructured":"Christian Benvenuti . 2009. Understanding Linux Network Internals . O'Reilly Media . 4 Christian Benvenuti. 2009. Understanding Linux Network Internals. O'Reilly Media. 4"},{"key":"e_1_3_2_1_15_1","unstructured":"Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In STOC. 3.2  Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In STOC. 3.2"},{"key":"e_1_3_2_1_16_1","unstructured":"Jonathan Corbet. 2005. Pluggable Congestion Avoidance Modules. https:\/\/lwn.net\/Articles\/128681\/. (2005). 3.2  Jonathan Corbet. 2005. Pluggable Congestion Avoidance Modules. https:\/\/lwn.net\/Articles\/128681\/. (2005). 3.2"},{"key":"e_1_3_2_1_17_1","unstructured":"Allen Cypher Daniel C. Halbert David Kurlander Henry Lieberman David Maulsby Brad A. Myers and Alan Turransky (Eds.). 1993. Watch What I Do: Programming by Demonstration. MIT Press. 3.1  Allen Cypher Daniel C. Halbert David Kurlander Henry Lieberman David Maulsby Brad A. Myers and Alan Turransky (Eds.). 1993. Watch What I Do: Programming by Demonstration. MIT Press. 3.1"},{"key":"e_1_3_2_1_18_1","first-page":"4","article-title":"Z3","volume":"3","author":"de Moura Leonardo Mendon\u00e7a","year":"2008","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner . 2008 . Z3 : An Efficient SMT Solver. In TACAS. 3 . 4 Leonardo Mendon\u00e7a de Moura and Nikolaj Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In TACAS. 3.4","journal-title":"An Efficient SMT Solver. In TACAS."},{"key":"e_1_3_2_1_19_1","volume-title":"claffy","author":"Dhamdhere A.","year":"2018","unstructured":"A. Dhamdhere , D. Clark , A. Gamero-Garrido , M. Luckie , R. Mok , G. Akiwate , K. Gogia , V. Bajpai , A. Snoeren , and k. claffy . 2018 . Inferring Persistent Interdomain Congestion. In SIGCOMM. 2.1 A. Dhamdhere, D. Clark, A. Gamero-Garrido, M. Luckie, R. Mok, G. Akiwate, K. Gogia, V. Bajpai, A. Snoeren, and k. claffy. 2018. Inferring Persistent Interdomain Congestion. In SIGCOMM. 2.1"},{"key":"e_1_3_2_1_20_1","volume-title":"Philip Brighten Godfrey, and Michael Schapira","author":"Dong Mo","year":"2015","unstructured":"Mo Dong , Qingxi Li , Doron Zarchy , Philip Brighten Godfrey, and Michael Schapira . 2015 . PCC : Re-architecting Congestion Control for Consistent High Performance. In NSDI. 2 Mo Dong, Qingxi Li, Doron Zarchy, Philip Brighten Godfrey, and Michael Schapira. 2015. PCC: Re-architecting Congestion Control for Consistent High Performance. In NSDI. 2"},{"key":"e_1_3_2_1_21_1","first-page":"4","article-title":"PCC Vivace","volume":"2","author":"Dong Mo","year":"2018","unstructured":"Mo Dong , Tong Meng , D Zarchy , E Arslan , Y Gilad , B Godfrey , and M Schapira . 2018 . PCC Vivace : Online-Learning Congestion Control. In NSDI. 2 , 4 Mo Dong, Tong Meng, D Zarchy, E Arslan, Y Gilad, B Godfrey, and M Schapira. 2018. PCC Vivace: Online-Learning Congestion Control. In NSDI. 2, 4","journal-title":"Online-Learning Congestion Control. In NSDI."},{"key":"e_1_3_2_1_22_1","first-page":"3","article-title":"Program Synthesis Using Conflict-Driven Learning","volume":"1","author":"Feng Yu","year":"2018","unstructured":"Yu Feng , Ruben Martins , Osbert Bastani , and Isil Dillig . 2018 . Program Synthesis Using Conflict-Driven Learning . In PLDI. 1 , 3 .1 Yu Feng, Ruben Martins, Osbert Bastani, and Isil Dillig. 2018. Program Synthesis Using Conflict-Driven Learning. In PLDI. 1, 3.1","journal-title":"PLDI."},{"key":"e_1_3_2_1_23_1","volume-title":"Isil Dillig, and Swarat Chaudhuri.","author":"Feng Yu","year":"2017","unstructured":"Yu Feng , Ruben Martins , Jacob Van Geffen , Isil Dillig, and Swarat Chaudhuri. 2017 . Component-Based Synthesis of Table Consolidation and Transformation Tasks From Examples. In PLDI. 3.1 Yu Feng, Ruben Martins, Jacob Van Geffen, Isil Dillig, and Swarat Chaudhuri. 2017. Component-Based Synthesis of Table Consolidation and Transformation Tasks From Examples. In PLDI. 3.1"},{"key":"e_1_3_2_1_24_1","first-page":"3","article-title":"Synthesizing Data Structure Transformations From Input-Output Examples","volume":"1","author":"Feser John K.","year":"2015","unstructured":"John K. Feser , Swarat Chaudhuri , and Isil Dillig . 2015 . Synthesizing Data Structure Transformations From Input-Output Examples . In PLDI. 1 , 3 .1 John K. Feser, Swarat Chaudhuri, and Isil Dillig. 2015. Synthesizing Data Structure Transformations From Input-Output Examples. In PLDI. 1, 3.1","journal-title":"PLDI."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Sally Floyd. 2003. HighSpeed TCP for Large Congestion Windows. https:\/\/www.ietf.org\/rfc\/rfc3649.txt. (2003). 1  Sally Floyd. 2003. HighSpeed TCP for Large Congestion Windows. https:\/\/www.ietf.org\/rfc\/rfc3649.txt. (2003). 1","DOI":"10.17487\/rfc3649"},{"key":"e_1_3_2_1_26_1","first-page":"2","article-title":"Equation-Based Congestion Control for Unicast Applications","volume":"1","author":"Floyd S.","year":"2000","unstructured":"S. Floyd , M. Handley , J. Padhye , and J. Widmer . 2000 . Equation-Based Congestion Control for Unicast Applications . In SIGCOMM. 1 , 2 S. Floyd, M. Handley, J. Padhye, and J. Widmer. 2000. Equation-Based Congestion Control for Unicast Applications. In SIGCOMM. 1, 2","journal-title":"SIGCOMM."},{"key":"e_1_3_2_1_27_1","volume-title":"Dapper: Data Plane Performance Diagnosis of TCP. In SOSR. https:\/\/doi.org\/10.1145\/3050220.3050228 2.1","author":"Ghasemi Mojgan","year":"2017","unstructured":"Mojgan Ghasemi , Theophilus Benson , and Jennifer Rexford . 2017 . Dapper: Data Plane Performance Diagnosis of TCP. In SOSR. https:\/\/doi.org\/10.1145\/3050220.3050228 2.1 10.1145\/3050220.3050228 Mojgan Ghasemi, Theophilus Benson, and Jennifer Rexford. 2017. Dapper: Data Plane Performance Diagnosis of TCP. In SOSR. https:\/\/doi.org\/10.1145\/3050220.3050228 2.1"},{"key":"e_1_3_2_1_28_1","first-page":"1","article-title":"Inspector Gadget","volume":"2","author":"Gong Sishuai","year":"2020","unstructured":"Sishuai Gong , Usama Naseer , and Theophilus A Benson . 2020 . Inspector Gadget : A Framework for Inferring TCP Congestion Control Algorithms and Protocol Configurations. In IFIP TMA. 2 . 1 Sishuai Gong, Usama Naseer, and Theophilus A Benson. 2020. Inspector Gadget: A Framework for Inferring TCP Congestion Control Algorithms and Protocol Configurations. In IFIP TMA. 2.1","journal-title":"In IFIP TMA."},{"key":"e_1_3_2_1_29_1","volume-title":"Spreadsheet Data Manipulation Using Examples. CACM 55, 8","author":"Gulwani Sumit","year":"2012","unstructured":"Sumit Gulwani , William R. Harris , and Rishabh Singh . 2012. Spreadsheet Data Manipulation Using Examples. CACM 55, 8 ( 2012 ). 1, 3.1 Sumit Gulwani, William R. Harris, and Rishabh Singh. 2012. Spreadsheet Data Manipulation Using Examples. CACM 55, 8 (2012). 1, 3.1"},{"key":"e_1_3_2_1_30_1","volume-title":"Program Synthesis. Foundations and Trends in Programming Languages 4","author":"Gulwani Sumit","year":"2017","unstructured":"Sumit Gulwani , Oleksandr Polozov , and Rishabh Singh . 2017. Program Synthesis. Foundations and Trends in Programming Languages 4 ( 2017 ). https:\/\/doi.org\/10.1561\/2500000010 1, 3 10.1561\/2500000010 Sumit Gulwani, Oleksandr Polozov, and Rishabh Singh. 2017. Program Synthesis. Foundations and Trends in Programming Languages 4 (2017). https:\/\/doi.org\/10.1561\/2500000010 1, 3"},{"key":"e_1_3_2_1_31_1","volume-title":"Rinard","author":"Handa Shivam","year":"2020","unstructured":"Shivam Handa and Martin C . Rinard . 2020 . Inductive Program Synthesis over Noisy Data. In ESEC\/FSE. 4 Shivam Handa and Martin C. Rinard. 2020. Inductive Program Synthesis over Noisy Data. In ESEC\/FSE. 4"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Mario Hock Roland Bless and Martina Zitterbart. 2017. Experimental Evaluation of BBR Congestion Control. In ICNP. 1  Mario Hock Roland Bless and Martina Zitterbart. 2017. Experimental Evaluation of BBR Congestion Control. In ICNP. 1","DOI":"10.1109\/ICNP.2017.8117540"},{"key":"e_1_3_2_1_33_1","first-page":"3","article-title":"Oracle-Guided Component-Based Program Synthesis","volume":"1","author":"Jha Susmit","year":"2010","unstructured":"Susmit Jha , Sumit Gulwani , Sanjit A. Seshia , and Ashish Tiwari . 2010 . Oracle-Guided Component-Based Program Synthesis . In ICSE. 1 , 3 .1 Susmit Jha, Sumit Gulwani, Sanjit A. Seshia, and Ashish Tiwari. 2010. Oracle-Guided Component-Based Program Synthesis. In ICSE. 1, 3.1","journal-title":"ICSE."},{"key":"e_1_3_2_1_34_1","first-page":"1","article-title":"Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples","volume":"3","author":"Kalyan Ashwin","year":"2018","unstructured":"Ashwin Kalyan , Abhishek Mohta , Oleksandr Polozov , Dhruv Batra , Prateek Jain , and Sumit Gulwani . 2018 . Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples . In ICLR (Poster). 3 . 1 Ashwin Kalyan, Abhishek Mohta, Oleksandr Polozov, Dhruv Batra, Prateek Jain, and Sumit Gulwani. 2018. Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples. In ICLR (Poster). 3.1","journal-title":"ICLR (Poster)."},{"key":"e_1_3_2_1_35_1","volume-title":"The Case for Model-Driven Interpretability of Delay-Based Congestion Control Protocols. SIGCOMM CCR 51, 1","author":"Khan Muhammad","year":"2021","unstructured":"Muhammad Khan , Yasir Zaki , Shiva Iyer , Talal Ahamd , Thomas Poetsch , Jay Chen , Anirudh Sivaraman , and Lakshmi Subramanian . 2021. The Case for Model-Driven Interpretability of Delay-Based Congestion Control Protocols. SIGCOMM CCR 51, 1 ( 2021 ). 1 Muhammad Khan, Yasir Zaki, Shiva Iyer, Talal Ahamd, Thomas Poetsch, Jay Chen, Anirudh Sivaraman, and Lakshmi Subramanian. 2021. The Case for Model-Driven Interpretability of Delay-Based Congestion Control Protocols. SIGCOMM CCR 51, 1 (2021). 1"},{"key":"e_1_3_2_1_36_1","volume-title":"But No Fuller. Ad Hoc Networks","author":"Kleinrock Leonard","year":"2018","unstructured":"Leonard Kleinrock . 2018. Internet Congestion Control Using the Power Metric: Keep the Pipe Just Full , But No Fuller. Ad Hoc Networks ( 2018 ). 1 Leonard Kleinrock. 2018. Internet Congestion Control Using the Power Metric: Keep the Pipe Just Full, But No Fuller. Ad Hoc Networks (2018). 1"},{"key":"e_1_3_2_1_37_1","unstructured":"T. Lan D. Kao M. Chiang and A. Sabharwal. 2010. An Axiomatic Theory of Fairness. In INFOCOM. 1  T. Lan D. Kao M. Chiang and A. Sabharwal. 2010. An Axiomatic Theory of Fairness. In INFOCOM. 1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Adam Langley Alistair Riddoch Alyssa Wilk Antonio Vicente Charles Krasic Dan Zhang Fan Yang Fedor Kouranov Ian Swett Janardhan Iyengar Jeff Bailey Jeremy Dorfman Jim Roskind Joanna Kulik Patrik Westin Raman Tenneti Robbie Shade Ryan Hamilton Victor Vasiliev Wan-Teh Chang and Zhongyi Shi. 2017. The QUIC Transport Protocol: Design and Internet-Scale Deployment. In SIGCOMM. 1  Adam Langley Alistair Riddoch Alyssa Wilk Antonio Vicente Charles Krasic Dan Zhang Fan Yang Fedor Kouranov Ian Swett Janardhan Iyengar Jeff Bailey Jeremy Dorfman Jim Roskind Joanna Kulik Patrik Westin Raman Tenneti Robbie Shade Ryan Hamilton Victor Vasiliev Wan-Teh Chang and Zhongyi Shi. 2017. The QUIC Transport Protocol: Design and Internet-Scale Deployment. In SIGCOMM. 1","DOI":"10.1145\/3098822.3098842"},{"key":"e_1_3_2_1_39_1","unstructured":"Woosuk Lee Kihong Heo Rajeev Alur and Mayur Naik. 2018. Accelerating Search-Based Program Synthesis Using Learned Probabilistic Models. In PLDI. 3.1  Woosuk Lee Kihong Heo Rajeev Alur and Mayur Naik. 2018. Accelerating Search-Based Program Synthesis Using Learned Probabilistic Models. In PLDI. 3.1"},{"key":"e_1_3_2_1_40_1","volume-title":"The New Yorker (Aug","author":"Clair McKelway St.","year":"1949","unstructured":"St. Clair McKelway . 1949. Old Eight-Eighty . The New Yorker (Aug . 1949 ). 2 St. Clair McKelway. 1949. Old Eight-Eighty. The New Yorker (Aug. 1949). 2"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366693"},{"key":"e_1_3_2_1_42_1","first-page":"3","article-title":"TIMELY","volume":"3","author":"Mittal Radhika","year":"2015","unstructured":"Radhika Mittal , Vinh The Lam , Nandita Dukkipati , Emily Blem , Hassan Wassel , Monia Ghobadi , Amin Vahdat , Yaogong Wang , David Wetherall , and David Zats . 2015 . TIMELY : RTT-based Congestion Control for the Datacenter. In SIGCOMM. 3 . 3 Radhika Mittal, Vinh The Lam, Nandita Dukkipati, Emily Blem, Hassan Wassel, Monia Ghobadi, Amin Vahdat, Yaogong Wang, David Wetherall, and David Zats. 2015. TIMELY: RTT-based Congestion Control for the Datacenter. In SIGCOMM. 3.3","journal-title":"RTT-based Congestion Control for the Datacenter. In SIGCOMM."},{"key":"e_1_3_2_1_43_1","first-page":"3","article-title":"Restructuring Endpoint Congestion Control","volume":"1","author":"Narayan Akshay","year":"2018","unstructured":"Akshay Narayan , Frank Cangialosi , Deepti Raghavan , Prateesh Goyal , Srinivas Narayana , Radhika Mittal , Mohammad Alizadeh , and Hari Balakrishnan . 2018 . Restructuring Endpoint Congestion Control . In SIGCOMM. 1 , 3 .2, 4 Akshay Narayan, Frank Cangialosi, Deepti Raghavan, Prateesh Goyal, Srinivas Narayana, Radhika Mittal, Mohammad Alizadeh, and Hari Balakrishnan. 2018. Restructuring Endpoint Congestion Control. In SIGCOMM. 1, 3.2, 4","journal-title":"SIGCOMM."},{"key":"e_1_3_2_1_44_1","unstructured":"Jitendra Pahdye and Sally Floyd. [n. d.]. On Inferring TCP Behavior. In SIGCOMM. 2.1  Jitendra Pahdye and Sally Floyd. [n. d.]. On Inferring TCP Behavior. In SIGCOMM. 2.1"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Jan R\u00fcth Ike Kunze and Oliver Hohlfeld. 2019. An Empirical View on Content Provider Fairness (IFIP TMA). 1 2.1  Jan R\u00fcth Ike Kunze and Oliver Hohlfeld. 2019. An Empirical View on Content Provider Fairness (IFIP TMA). 1 2.1","DOI":"10.23919\/TMA.2019.8784684"},{"key":"e_1_3_2_1_46_1","first-page":"1","article-title":"DeePCCI","volume":"2","author":"Sander Constantin","year":"2019","unstructured":"Constantin Sander , Jan R\u00fcth , Oliver Hohlfeld , and Klaus Wehrle . 2019 . DeePCCI : Deep Learning-Based Passive Congestion Control Identification. In NetAI. 2 . 1 Constantin Sander, Jan R\u00fcth, Oliver Hohlfeld, and Klaus Wehrle. 2019. DeePCCI: Deep Learning-Based Passive Congestion Control Identification. In NetAI. 2.1","journal-title":"Deep Learning-Based Passive Congestion Control Identification. In NetAI."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Dominik Scholz Benedikt Jaeger Lukas Schwaighofer Daniel Raumer Fabien Geyer and Georg Carle. 2018. Towards a Deeper Understanding of TCP BBR Congestion Control. In IFIP Networking. 2  Dominik Scholz Benedikt Jaeger Lukas Schwaighofer Daniel Raumer Fabien Geyer and Georg Carle. 2018. Towards a Deeper Understanding of TCP BBR Congestion Control. In IFIP Networking. 2","DOI":"10.23919\/IFIPNetworking.2018.8696830"},{"key":"e_1_3_2_1_48_1","volume-title":"Boon Thau Loo, and Rajeev Alur","author":"Shi Lei","year":"2021","unstructured":"Lei Shi , Yahui Li , Boon Thau Loo, and Rajeev Alur . 2021 . Network Traffic Classification by Program Synthesis. In TACAS. 3.1 Lei Shi, Yahui Li, Boon Thau Loo, and Rajeev Alur. 2021. Network Traffic Classification by Program Synthesis. In TACAS. 3.1"},{"key":"e_1_3_2_1_49_1","unstructured":"Viswanath Sivakumar Tim Rockt\u00e4schel Alexander H. Miller Heinrich K\u00fcttler Nantas Nardelli Mike Rabbat Joelle Pineau and Sebastian Riedel. 2019. MVFST-RL: An Asynchronous RL Framework for Congestion Control with Delayed Actions. http:\/\/arxiv.org\/abs\/1910.04054. (2019). 4  Viswanath Sivakumar Tim Rockt\u00e4schel Alexander H. Miller Heinrich K\u00fcttler Nantas Nardelli Mike Rabbat Joelle Pineau and Sebastian Riedel. 2019. MVFST-RL: An Asynchronous RL Framework for Congestion Control with Delayed Actions. http:\/\/arxiv.org\/abs\/1910.04054. (2019). 4"},{"key":"e_1_3_2_1_50_1","first-page":"3","article-title":"Programming by Sketching for Bit-Streaming Programs","volume":"1","author":"Solar-Lezama Armando","year":"2005","unstructured":"Armando Solar-Lezama , Rodric M. Rabbah , Rastislav Bod\u00edk , and Kemal Ebcioglu . 2005 . Programming by Sketching for Bit-Streaming Programs . In PLDI. 1 , 3 .1 Armando Solar-Lezama, Rodric M. Rabbah, Rastislav Bod\u00edk, and Kemal Ebcioglu. 2005. Programming by Sketching for Bit-Streaming Programs. In PLDI. 1, 3.1","journal-title":"PLDI."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375235.3375241"},{"volume-title":"The Mathematics of Internet Congestion Control","author":"Srikant R.","key":"e_1_3_2_1_52_1","unstructured":"R. Srikant . 2004. The Mathematics of Internet Congestion Control . Birkhauser . 1 R. Srikant. 2004. The Mathematics of Internet Congestion Control. Birkhauser. 1"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Belma Turkovic and Fernando Kuipers. 2020. P4air: Increasing Fairness among Competing Congestion Control Algorithms. In ICNP. 2.1  Belma Turkovic and Fernando Kuipers. 2020. P4air: Increasing Fairness among Competing Congestion Control Algorithms. In ICNP. 2.1","DOI":"10.1109\/ICNP49622.2020.9259405"},{"key":"e_1_3_2_1_54_1","unstructured":"Belma Turkovic Fernando A. Kuipers and Steve Uhlig. 2019. Fifty Shades of Congestion Control: A Performance and Interactions Evaluation. https:\/\/arxiv.org\/abs\/1903.03852. (2019). 2  Belma Turkovic Fernando A. Kuipers and Steve Uhlig. 2019. Fifty Shades of Congestion Control: A Performance and Interactions Evaluation. https:\/\/arxiv.org\/abs\/1903.03852. (2019). 2"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Ranysha Ware Matthew K. Mukerjee Srinivasan Seshan and Justine Sherry. 2019. Beyond Jain's Fairness Index: Setting the Bar for the Deployment of Congestion Control Algorithms. In HotNets. 1  Ranysha Ware Matthew K. Mukerjee Srinivasan Seshan and Justine Sherry. 2019. Beyond Jain's Fairness Index: Setting the Bar for the Deployment of Congestion Control Algorithms. In HotNets. 1","DOI":"10.1145\/3365609.3365855"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355369.3355604"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886335"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Keith Winstein and Hari Balakrishnan. 2013. TCP ex Machina: Computer-Generated Congestion Control. In SIGCOMM. 4  Keith Winstein and Hari Balakrishnan. 2013. TCP ex Machina: Computer-Generated Congestion Control. In SIGCOMM. 4","DOI":"10.1145\/2486001.2486020"},{"issue":"1","key":"e_1_3_2_1_59_1","first-page":"3","article-title":"Scenario-Based Programming for SDN Policies","volume":"3","author":"Yuan Yifei","year":"2015","unstructured":"Yifei Yuan , Dong Lin , Rajeev Alur , and Boon Thau Loo . 2015 . Scenario-Based Programming for SDN Policies . In CoNEXT. 3 . 1 , 3 Yifei Yuan, Dong Lin, Rajeev Alur, and Boon Thau Loo. 2015. Scenario-Based Programming for SDN Policies. In CoNEXT. 3.1, 3","journal-title":"CoNEXT."},{"key":"e_1_3_2_1_60_1","volume-title":"Axiomatizing Congestion Control. SIGMETRICS","author":"Zarchy Doron","year":"2019","unstructured":"Doron Zarchy , Radhika Mittal , Michael Schapira , and Scott Shenker . 2019. Axiomatizing Congestion Control. SIGMETRICS ( 2019 ). 1, 2 Doron Zarchy, Radhika Mittal, Michael Schapira, and Scott Shenker. 2019. Axiomatizing Congestion Control. SIGMETRICS (2019). 1, 2"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Yin Zhang Lee Breslau Vern Paxson and Scott Shenker. 2002. On the Characteristics and Origins of Internet Flow Rates. In SIGCOMM. 2.1  Yin Zhang Lee Breslau Vern Paxson and Scott Shenker. 2002. On the Characteristics and Origins of Internet Flow Rates. In SIGCOMM. 2.1","DOI":"10.1145\/633025.633055"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Yibo Zhu Monia Ghobadi Vishal Misra and Jitendra Padhye. 2016. ECN or Delay: Lessons Learnt from Analysis of DCQCN and TIMELY. In CoNEXT. 2  Yibo Zhu Monia Ghobadi Vishal Misra and Jitendra Padhye. 2016. ECN or Delay: Lessons Learnt from Analysis of DCQCN and TIMELY. In CoNEXT. 2","DOI":"10.1145\/2999572.2999593"}],"event":{"name":"HotNets '21: The 20th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual Event United Kingdom","acronym":"HotNets '21"},"container-title":["Proceedings of the Twentieth ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484266.3487381","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3484266.3487381","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484266.3487381","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3484266.3487381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:13Z","timestamp":1750191433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3484266.3487381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,4]]},"references-count":63,"alternative-id":["10.1145\/3484266.3487381","10.1145\/3484266"],"URL":"https:\/\/doi.org\/10.1145\/3484266.3487381","relation":{},"subject":[],"published":{"date-parts":[[2021,11,4]]},"assertion":[{"value":"2021-11-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}