{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:31:43Z","timestamp":1775745103524,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1918757, 1652257, 1813487"],"award-info":[{"award-number":["1918757, 1652257, 1813487"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ONR Award","award":["N00014-18-1-2364"],"award-info":[{"award-number":["N00014-18-1-2364"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3452296.3472887","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T18:13:15Z","timestamp":1628532795000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":90,"title":["Programmable packet scheduling with a single queue"],"prefix":"10.1145","author":[{"given":"Zhuolong","family":"Yu","sequence":"first","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Chuheng","family":"Hu","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Jingfeng","family":"Wu","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Xiao","family":"Sun","sequence":"additional","affiliation":[{"name":"Stony Brook University"}]},{"given":"Vladimir","family":"Braverman","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Mosharaf","family":"Chowdhury","sequence":"additional","affiliation":[{"name":"University of Michigan"}]},{"given":"Zhenhua","family":"Liu","sequence":"additional","affiliation":[{"name":"Stony Brook University"}]},{"given":"Xin","family":"Jin","sequence":"additional","affiliation":[{"name":"Peking University"}]}],"member":"320","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2017. Netbench. http:\/\/github.com\/ndal-eth\/.  2017. Netbench. http:\/\/github.com\/ndal-eth\/."},{"key":"e_1_3_2_2_2_1","unstructured":"2018. Intel Data Plane Development Kit (DPDK). http:\/\/dpdk.org\/.  2018. Intel Data Plane Development Kit (DPDK). http:\/\/dpdk.org\/."},{"key":"e_1_3_2_2_3_1","unstructured":"Albert Gran Alcoz Alexander Dietm\u00fcller and Laurent Vanbever. 2020. SP-PIFO: Approximating Push-In First-Out Behaviors using Strict-Priority Queues. In USENIX NSDI.  Albert Gran Alcoz Alexander Dietm\u00fcller and Laurent Vanbever. 2020. SP-PIFO: Approximating Push-In First-Out Behaviors using Strict-Priority Queues. In USENIX NSDI ."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Mohammad Alizadeh Albert Greenberg David A Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2011. Data Center TCP (DCTCP). In ACM SIGCOMM.  Mohammad Alizadeh Albert Greenberg David A Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2011. Data Center TCP (DCTCP). In ACM SIGCOMM .","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_2_5_1","unstructured":"Mohammad Alizadeh Abdul Kabbani Tom Edsall Balaji Prabhakar Amin Vahdat and Masato Yasuda. 2012. Less is more: Trading a little bandwidth for ultra-low latency in the data center. In USENIX NSDI.  Mohammad Alizadeh Abdul Kabbani Tom Edsall Balaji Prabhakar Amin Vahdat and Masato Yasuda. 2012. Less is more: Trading a little bandwidth for ultra-low latency in the data center. In USENIX NSDI ."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486031"},{"key":"e_1_3_2_2_7_1","unstructured":"Wei Bai Li Chen Kai Chen Dongsu Han Chen Tian and Hao Wang. 2015. Information-Agnostic Flow Scheduling for Commodity Data Centers. In USENIX NSDI.  Wei Bai Li Chen Kai Chen Dongsu Han Chen Tian and Hao Wang. 2015. Information-Agnostic Flow Scheduling for Commodity Data Centers. In USENIX NSDI ."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Mosharaf Chowdhury and Ion Stoica. 2015. Efficient Coflow Scheduling Without Prior Knowledge. In ACM SIGCOMM.  Mosharaf Chowdhury and Ion Stoica. 2015. Efficient Coflow Scheduling Without Prior Knowledge. In ACM SIGCOMM .","DOI":"10.1145\/2785956.2787480"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Mosharaf Chowdhury Yuan Zhong and Ion Stoica. 2014. Efficient coflow scheduling with Varys. In ACM SIGCOMM.  Mosharaf Chowdhury Yuan Zhong and Ion Stoica. 2014. Efficient coflow scheduling with Varys. In ACM SIGCOMM .","DOI":"10.1145\/2619239.2626315"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460871"},{"key":"e_1_3_2_2_11_1","volume-title":"Analysis and Simulation of a Fair Queueing Algorithm. SIGCOMM CCR (August","author":"Demers Alan","year":"1989","unstructured":"Alan Demers , Srinivasan Keshav , and Scott Shenker . 1989. Analysis and Simulation of a Fair Queueing Algorithm. SIGCOMM CCR (August 1989 ). Alan Demers, Srinivasan Keshav, and Scott Shenker. 1989. Analysis and Simulation of a Fair Queueing Algorithm. SIGCOMM CCR (August 1989)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251892"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.649569"},{"key":"e_1_3_2_2_14_1","volume-title":"Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM.","author":"Gupta Arpit","year":"2018","unstructured":"Arpit Gupta , Rob Harrison , Marco Canini , Nick Feamster , Jennifer Rexford , and Walter Willinger . 2018 . Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM. Arpit Gupta, Rob Harrison, Marco Canini, Nick Feamster, Jennifer Rexford, and Walter Willinger. 2018. Sonata: Query-driven streaming network telemetry. In ACM SIGCOMM."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Chi-Yao Hong Matthew Caesar and P Godfrey. 2012. Finishing flows quickly with preemptive scheduling. In ACM SIGCOMM.  Chi-Yao Hong Matthew Caesar and P Godfrey. 2012. Finishing flows quickly with preemptive scheduling. In ACM SIGCOMM .","DOI":"10.1145\/2342356.2342389"},{"key":"e_1_3_2_2_16_1","volume-title":"Contra: A programmable system for performance-aware routing. In USENIX NSDI.","author":"Hsu Kuo-Feng","year":"2020","unstructured":"Kuo-Feng Hsu , Ryan Beckett , Ang Chen , Jennifer Rexford , Praveen Tammana , and David Walker . 2020 . Contra: A programmable system for performance-aware routing. In USENIX NSDI. Kuo-Feng Hsu, Ryan Beckett, Ang Chen, Jennifer Rexford, Praveen Tammana, and David Walker. 2020. Contra: A programmable system for performance-aware routing. In USENIX NSDI."},{"key":"e_1_3_2_2_17_1","volume-title":"Aeolus: A building block for proactive transport in datacenters. In ACM SIGCOMM.","author":"Hu Shuihai","year":"2020","unstructured":"Shuihai Hu , Wei Bai , Gaoxiong Zeng , Zilong Wang , Baochen Qiao , Kai Chen , Kun Tan , and Yi Wang . 2020 . Aeolus: A building block for proactive transport in datacenters. In ACM SIGCOMM. Shuihai Hu, Wei Bai, Gaoxiong Zeng, Zilong Wang, Baochen Qiao, Kai Chen, Kun Tan, and Yi Wang. 2020. Aeolus: A building block for proactive transport in datacenters. In ACM SIGCOMM."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365433"},{"key":"e_1_3_2_2_19_1","unstructured":"Xin Jin Xiaozhou Li Haoyu Zhang Nate Foster Jeongkeun Lee Robert Soul\u00e9 Changhoon Kim and Ion Stoica. 2018. NetChain: Scale-Free Sub-RTT Coordination. In USENIX NSDI.  Xin Jin Xiaozhou Li Haoyu Zhang Nate Foster Jeongkeun Lee Robert Soul\u00e9 Changhoon Kim and Ion Stoica. 2018. NetChain: Scale-Free Sub-RTT Coordination. In USENIX NSDI ."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Xin Jin Xiaozhou Li Haoyu Zhang Robert Soul\u00e9 Jeongkeun Lee Nate Foster Changhoon Kim and Ion Stoica. 2017. NetCache: Balancing Key-Value Stores with Fast In-Network Caching. In ACM SOSP.  Xin Jin Xiaozhou Li Haoyu Zhang Robert Soul\u00e9 Jeongkeun Lee Nate Foster Changhoon Kim and Ion Stoica. 2017. NetCache: Balancing Key-Value Stores with Fast In-Network Caching. In ACM SOSP .","DOI":"10.1145\/3132747.3132764"},{"key":"e_1_3_2_2_21_1","volume-title":"On the efficient implementation of fair queueing","author":"Keshav Srinivasan","year":"1991","unstructured":"Srinivasan Keshav . 1991. On the efficient implementation of fair queueing . Internetworking : Research and Experience (September 1991 ). Srinivasan Keshav. 1991. On the efficient implementation of fair queueing. Internetworking: Research and Experience (September 1991)."},{"key":"e_1_3_2_2_22_1","volume-title":"Xian Wu, Behnam Montazeri, Yaogong Wang, Kevin Springborn, Christopher Alfeld, Michael Ryan, David Wetherall, and Amin Vahdat.","author":"Kumar Gautam","year":"2020","unstructured":"Gautam Kumar , Nandita Dukkipati , Keon Jang , Hassan MG Wassel , Xian Wu, Behnam Montazeri, Yaogong Wang, Kevin Springborn, Christopher Alfeld, Michael Ryan, David Wetherall, and Amin Vahdat. 2020 . Swift : Delay is simple and effective for congestion control in the datacenter. In ACM SIGCOMM. Gautam Kumar, Nandita Dukkipati, Keon Jang, Hassan MG Wassel, Xian Wu, Behnam Montazeri, Yaogong Wang, Kevin Springborn, Christopher Alfeld, Michael Ryan, David Wetherall, and Amin Vahdat. 2020. Swift: Delay is simple and effective for congestion control in the datacenter. In ACM SIGCOMM."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553887"},{"key":"e_1_3_2_2_24_1","volume-title":"Ports","author":"Li Jialin","year":"2017","unstructured":"Jialin Li , Ellis Michael , and Dan R. K . Ports . 2017 . Eris : Coordination-Free Consistent Transactions Using In-Network Concurrency Control. In ACM SOSP. Jialin Li, Ellis Michael, and Dan R. K. Ports. 2017. Eris: Coordination-Free Consistent Transactions Using In-Network Concurrency Control. In ACM SOSP."},{"key":"e_1_3_2_2_25_1","volume-title":"Ports","author":"Li Jialin","year":"2016","unstructured":"Jialin Li , Ellis Michael , Naveen Kr. Sharma , Adriana Szekeres , and Dan R.K . Ports . 2016 . Just say NO to Paxos overhead: Replacing consensus with network ordering. In USENIX OSDI. Jialin Li, Ellis Michael, Naveen Kr. Sharma, Adriana Szekeres, and Dan R.K. Ports. 2016. Just say NO to Paxos overhead: Replacing consensus with network ordering. In USENIX OSDI."},{"key":"e_1_3_2_2_26_1","unstructured":"Zaoxing Liu Zhihao Bai Zhenming Liu Xiaozhou Li Changhoon Kim Vladimir Braverman Xin Jin and Ion Stoica. 2019.. DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching. In USENIX FAST.  Zaoxing Liu Zhihao Bai Zhenming Liu Xiaozhou Li Changhoon Kim Vladimir Braverman Xin Jin and Ion Stoica. 2019.. DistCache: Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching. In USENIX FAST ."},{"key":"e_1_3_2_2_27_1","volume-title":"Stochastic Fairness Queueing","author":"McKenney Paul E","unstructured":"Paul E McKenney . 1990. Stochastic Fairness Queueing .. In IEEE INFOCOM. Paul E McKenney. 1990. Stochastic Fairness Queueing.. In IEEE INFOCOM."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098824"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Radhika Mittal Rachit Agarwal Sylvia Ratnasamy and Scott Shenker. 2016. Universal packet scheduling. In USENIX NSDI.  Radhika Mittal Rachit Agarwal Sylvia Ratnasamy and Scott Shenker. 2016. Universal packet scheduling. In USENIX NSDI .","DOI":"10.1145\/2834050.2834085"},{"key":"e_1_3_2_2_30_1","volume-title":"Nandita Dukkipati, Emily Blem, Hassan Wassel, Monia Ghobadi, Amin Vahdat, Yaogong Wang, David Wetherall, and David Zats.","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. SIGCOMM CCR (August 2015). 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. SIGCOMM CCR (August 2015)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Srinivas Narayana Anirudh Sivaraman Vikram Nathan Prateesh Goyal Venkat Arun Mohammad Alizadeh Vimalkumar Jeyakumar and Changhoon Kim. 2017. Language-Directed Hardware Design for Network Performance Monitoring. In ACM SIGCOMM.  Srinivas Narayana Anirudh Sivaraman Vikram Nathan Prateesh Goyal Venkat Arun Mohammad Alizadeh Vimalkumar Jeyakumar and Changhoon Kim. 2017. Language-Directed Hardware Design for Network Performance Monitoring. In ACM SIGCOMM .","DOI":"10.1145\/3098822.3098829"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Kathleen Nichols and Van Jacobson. 2012. Controlling Queue Delay: A modern AQM is just one piece of the solution to bufferbloat. In ACM Queue.  Kathleen Nichols and Van Jacobson. 2012. Controlling Queue Delay: A modern AQM is just one piece of the solution to bufferbloat. In ACM Queue .","DOI":"10.1145\/2208917.2209336"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2007.06.028"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Rong Pan Lee Breslau Balaji Prabhakar and Scott Shenker. 2003. Approximate Fairness through Differential Dropping. In ACM SIGCOMM.  Rong Pan Lee Breslau Balaji Prabhakar and Scott Shenker. 2003. Approximate Fairness through Differential Dropping. In ACM SIGCOMM .","DOI":"10.1145\/956981.956985"},{"key":"e_1_3_2_2_35_1","volume-title":"CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation","author":"Pan Rong","unstructured":"Rong Pan , Balaji Prabhakar , and Konstantinos Psounis . 2000. CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation . In IEEE INFOCOM. Rong Pan, Balaji Prabhakar, and Konstantinos Psounis. 2000. CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation. In IEEE INFOCOM."},{"key":"e_1_3_2_2_36_1","unstructured":"Dan R. K. Ports Jialin Li Vincent Liu Naveen Kr. Sharma and Arvind Krishnamurthy. 2015. Designing Distributed Systems Using Approximate Synchrony in Data Center Networks. In USENIX NSDI.  Dan R. K. Ports Jialin Li Vincent Liu Naveen Kr. Sharma and Arvind Krishnamurthy. 2015. Designing Distributed Systems Using Approximate Synchrony in Data Center Networks. In USENIX NSDI ."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/885651.781055"},{"key":"e_1_3_2_2_38_1","volume-title":"Eiffel: Efficient and flexible software packet scheduling. In USENIX NSDI.","author":"Saeed Ahmed","year":"2019","unstructured":"Ahmed Saeed , Yimeng Zhao , Nandita Dukkipati , Ellen Zegura , Mostafa Ammar , Khaled Harras , and Amin Vahdat . 2019 . Eiffel: Efficient and flexible software packet scheduling. In USENIX NSDI. Ahmed Saeed, Yimeng Zhao, Nandita Dukkipati, Ellen Zegura, Mostafa Ammar, Khaled Harras, and Amin Vahdat. 2019. Eiffel: Efficient and flexible software packet scheduling. In USENIX NSDI."},{"key":"e_1_3_2_2_39_1","unstructured":"Amedeo Sapio Marco Canini Chen-Yu Ho Jacob Nelson Panos Kalnis Changhoon Kim Arvind Krishnamurthy Masoud Moshref Dan Ports and Peter Richtarik. 2021. Scaling Distributed Machine Learning with In-Network Aggregation. In USENIX NSDI.  Amedeo Sapio Marco Canini Chen-Yu Ho Jacob Nelson Panos Kalnis Changhoon Kim Arvind Krishnamurthy Masoud Moshref Dan Ports and Peter Richtarik. 2021. Scaling Distributed Machine Learning with In-Network Aggregation. In USENIX NSDI ."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.803382"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.670"},{"key":"e_1_3_2_2_42_1","unstructured":"Naveen Kr Sharma Ming Liu Kishore Atreya and Arvind Krishnamurthy. 2018. Approximating fair queueing on reconfigurable switches. In USENIX NSDI.  Naveen Kr Sharma Ming Liu Kishore Atreya and Arvind Krishnamurthy. 2018. Approximating fair queueing on reconfigurable switches. In USENIX NSDI ."},{"key":"e_1_3_2_2_43_1","unstructured":"Naveen Kr Sharma Chenxingyu Zhao Ming Liu Pravein G Kannan Changhoon Kim Arvind Krishnamurthy and Anirudh Sivaraman. 2020. Programmable calendar queues for high-speed packet scheduling. In USENIX NSDI.  Naveen Kr Sharma Chenxingyu Zhao Ming Liu Pravein G Kannan Changhoon Kim Arvind Krishnamurthy and Anirudh Sivaraman. 2020. Programmable calendar queues for high-speed packet scheduling. In USENIX NSDI ."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Madhavapeddi Shreedhar and George Varghese. 1995. Efficient fair queueing using deficit round robin. In ACM SIGCOMM.  Madhavapeddi Shreedhar and George Varghese. 1995. Efficient fair queueing using deficit round robin. In ACM SIGCOMM .","DOI":"10.1145\/217382.217453"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Vishal Shrivastav. 2019. Fast scalable and programmable packet scheduler in hardware. In ACM SIGCOMM.  Vishal Shrivastav. 2019. Fast scalable and programmable packet scheduler in hardware. In ACM SIGCOMM .","DOI":"10.1145\/3341302.3342090"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Anirudh Sivaraman Alvin Cheung Mihai Budiu Changhoon Kim Mohammad Alizadeh Hari Balakrishnan George Varghese Nick McKeown and Steve Licking. 2016a. Packet transactions: High-level programming for line-rate switches. In ACM SIGCOMM.  Anirudh Sivaraman Alvin Cheung Mihai Budiu Changhoon Kim Mohammad Alizadeh Hari Balakrishnan George Varghese Nick McKeown and Steve Licking. 2016a. Packet transactions: High-level programming for line-rate switches. In ACM SIGCOMM .","DOI":"10.1145\/2934872.2934900"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Anirudh Sivaraman Suvinay Subramanian Mohammad Alizadeh Sharad Chole Shang-Tse Chuang Anurag Agrawal Hari Balakrishnan Tom Edsall Sachin Katti and Nick McKeown. 2016b. Programmable packet scheduling at line rate. In ACM SIGCOMM.  Anirudh Sivaraman Suvinay Subramanian Mohammad Alizadeh Sharad Chole Shang-Tse Chuang Anurag Agrawal Hari Balakrishnan Tom Edsall Sachin Katti and Nick McKeown. 2016b. Programmable packet scheduling at line rate. In ACM SIGCOMM .","DOI":"10.1145\/2934872.2934899"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Ion Stoica Scott Shenker and Hui Zhang. 1998. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In ACM SIGCOMM.  Ion Stoica Scott Shenker and Hui Zhang. 1998. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In ACM SIGCOMM .","DOI":"10.21236\/ADA363498"},{"key":"e_1_3_2_2_49_1","unstructured":"Zhuolong Yu Jingfeng Wu Vladimir Braverman Ion Stoica and Xin Jin. 2021. Twenty Years After: Hierarchical Core-Stateless Fair Queueing. In USENIX NSDI.  Zhuolong Yu Jingfeng Wu Vladimir Braverman Ion Stoica and Xin Jin. 2021. Twenty Years After: Hierarchical Core-Stateless Fair Queueing. In USENIX NSDI ."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405857"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368301"}],"event":{"name":"SIGCOMM '21: ACM SIGCOMM 2021 Conference","location":"Virtual Event USA","acronym":"SIGCOMM '21","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2021 ACM SIGCOMM 2021 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472887","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:13Z","timestamp":1750197673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":51,"alternative-id":["10.1145\/3452296.3472887","10.1145\/3452296"],"URL":"https:\/\/doi.org\/10.1145\/3452296.3472887","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-08-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}