{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:48:16Z","timestamp":1777502896983,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":86,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T00:00:00Z","timestamp":1596067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P025374\/1"],"award-info":[{"award-number":["EP\/P025374\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1829349, CCF-1563710, CCF-1535795"],"award-info":[{"award-number":["1829349, CCF-1563710, CCF-1535795"]}],"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":[[2020,7,30]]},"DOI":"10.1145\/3387514.3405894","type":"proceedings-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T22:35:31Z","timestamp":1596148531000},"page":"662-680","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":234,"title":["PINT"],"prefix":"10.1145","author":[{"given":"Ran","family":"Ben Basat","sequence":"first","affiliation":[{"name":"Harvard University"}]},{"given":"Sivaramakrishnan","family":"Ramanathan","sequence":"additional","affiliation":[{"name":"University of Southern California"}]},{"given":"Yuliang","family":"Li","sequence":"additional","affiliation":[{"name":"Harvard University"}]},{"given":"Gianni","family":"Antichi","sequence":"additional","affiliation":[{"name":"Queen Mary University of London"}]},{"given":"Minian","family":"Yu","sequence":"additional","affiliation":[{"name":"Harvard University"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University"}]}],"member":"320","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2020. PINT open source code: https:\/\/github.com\/ProbabilisticINT. (2020). https:\/\/github.com\/ProbabilisticINT  2020. PINT open source code: https:\/\/github.com\/ProbabilisticINT. (2020). https:\/\/github.com\/ProbabilisticINT"},{"key":"e_1_3_2_2_2_1","volume-title":"Francis Matus, Rong Pan, Navindra Yadav, and George Varghese.","author":"Alizadeh Mohammad","year":"2014","unstructured":"Mohammad Alizadeh , Tom Edsall , Sarang Dharmapurikar , Ramanan Vaidyanathan , Kevin Chu , Andy Fingerhut , Vinh The Lam , Francis Matus, Rong Pan, Navindra Yadav, and George Varghese. 2014 . CONGA : Distributed Congestion-aware Load Balancing for Datacenters. In ACM SIGCOMM. Mohammad Alizadeh, Tom Edsall, Sarang Dharmapurikar, Ramanan Vaidyanathan, Kevin Chu, Andy Fingerhut, Vinh The Lam, Francis Matus, Rong Pan, Navindra Yadav, and George Varghese. 2014. CONGA: Distributed Congestion-aware Load Balancing for Datacenters. In ACM SIGCOMM."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Mohammad Alizadeh Albert Greenberg David A. Maltz Jitendra Padhye Parveen Patel Balaji Prabhakar Sudipta Sengupta and Murari Sridharan. 2010. 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. 2010. Data Center TCP (DCTCP). In ACM SIGCOMM.","DOI":"10.1145\/1851182.1851192"},{"key":"e_1_3_2_2_4_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_5_1","doi-asserted-by":"crossref","unstructured":"Arvind Arasu and Gurmeet Singh Manku. 2004. Approximate Counts and Quantiles over Sliding Windows. In ACM PODS.  Arvind Arasu and Gurmeet Singh Manku. 2004. Approximate Counts and Quantiles over Sliding Windows. In ACM PODS.","DOI":"10.1145\/1055558.1055598"},{"key":"e_1_3_2_2_6_1","volume-title":"Jitu Padhye","author":"Arzani Behnaz","year":"2018","unstructured":"Behnaz Arzani , Selim Ciraci , Luiz Chamon , Yibo Zhu , Hongqiang Harry Liu , Jitu Padhye , Boon Thau Loo, and Geoff Outhred. 2018 . 007: Democratically Finding the Cause of Packet Drops. In USENIX NSDI. Behnaz Arzani, Selim Ciraci, Luiz Chamon, Yibo Zhu, Hongqiang Harry Liu, Jitu Padhye, Boon Thau Loo, and Geoff Outhred. 2018. 007: Democratically Finding the Cause of Packet Drops. In USENIX NSDI."},{"key":"e_1_3_2_2_7_1","volume-title":"Fast Userspace Packet Processing","author":"Barbette Tom","unstructured":"Tom Barbette , Cyril Soldani , and Laurent Mathy . 2015. Fast Userspace Packet Processing . In IEEE\/ACM ANCS. Tom Barbette, Cyril Soldani, and Laurent Mathy. 2015. Fast Userspace Packet Processing. In IEEE\/ACM ANCS."},{"key":"e_1_3_2_2_8_1","unstructured":"Barefoot. [n. d.]. Barefoot Deep Insight. https:\/\/barefootnetworks.com\/products\/brief-deep-insight\/. ([n. d.]).  Barefoot. [n. d.]. Barefoot Deep Insight. https:\/\/barefootnetworks.com\/products\/brief-deep-insight\/. ([n. d.])."},{"key":"e_1_3_2_2_9_1","unstructured":"Barefoot Networks. 2018. Barefoot Deep Insight. https:\/\/www.barefootnetworks.com\/static\/app\/pdf\/DI-UG42-003ea-ProdBrief.pdf. (2018).  Barefoot Networks. 2018. Barefoot Deep Insight. https:\/\/www.barefootnetworks.com\/static\/app\/pdf\/DI-UG42-003ea-ProdBrief.pdf. (2018)."},{"key":"e_1_3_2_2_10_1","volume-title":"Danny Raz, and Minlan Yu.","author":"Basat Ran Ben","year":"2020","unstructured":"Ran Ben Basat , Xiaoqi Chen , Gil Einziger , Shir Landau Feibish , Danny Raz, and Minlan Yu. 2020 . Routing Oblivious Measurement Analytics. In IFIP Networking . Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Shir Landau Feibish, Danny Raz, and Minlan Yu. 2020. Routing Oblivious Measurement Analytics. In IFIP Networking."},{"key":"e_1_3_2_2_11_1","volume-title":"Memento: Making Sliding Windows Efficient for Heavy Hitters. In ACM CoNEXT.","author":"Basat Ran Ben","year":"2018","unstructured":"Ran Ben Basat , Gil Einziger , Isaac Keslassy , Ariel Orda , Shay Vargaftik , and Erez Waisbard . 2018 . Memento: Making Sliding Windows Efficient for Heavy Hitters. In ACM CoNEXT. Ran Ben Basat, Gil Einziger, Isaac Keslassy, Ariel Orda, Shay Vargaftik, and Erez Waisbard. 2018. Memento: Making Sliding Windows Efficient for Heavy Hitters. In ACM CoNEXT."},{"key":"e_1_3_2_2_12_1","volume-title":"Efficient Measurement on Programmable Switches using Probabilistic Recirculation","author":"Ben-Basat Ran","unstructured":"Ran Ben-Basat , Xiaoqi Chen , Gil Einziger , and Ori Rottenstreich . 2018. Efficient Measurement on Programmable Switches using Probabilistic Recirculation . In IEEE ICNP. Ran Ben-Basat, Xiaoqi Chen, Gil Einziger, and Ori Rottenstreich. 2018. Efficient Measurement on Programmable Switches using Probabilistic Recirculation. In IEEE ICNP."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ran Ben-Basat Gil Einziger and Roy Friedman. 2018. Fast flow volume estimation. Pervasive Mob. Comput. (2018).  Ran Ben-Basat Gil Einziger and Roy Friedman. 2018. Fast flow volume estimation. Pervasive Mob. Comput. (2018).","DOI":"10.1145\/3154273.3154332"},{"key":"e_1_3_2_2_14_1","unstructured":"Broadcom. [n. d.]. Broadcom BCM56870 Series. https:\/\/www.broadcom.com\/products\/ethernet-connectivity\/switching\/strataxgs\/bcm56870-series. ([n. d.]).  Broadcom. [n. d.]. Broadcom BCM56870 Series. https:\/\/www.broadcom.com\/products\/ethernet-connectivity\/switching\/strataxgs\/bcm56870-series. ([n. d.])."},{"key":"e_1_3_2_2_15_1","volume-title":"Server selection using dynamic path characterization in wide-area networks","author":"Carter Robert L","unstructured":"Robert L Carter and Mark E Crovella . 1997. Server selection using dynamic path characterization in wide-area networks . In IEEE INFOCOM. Robert L Carter and Mark E Crovella. 1997. Server selection using dynamic path characterization in wide-area networks. In IEEE INFOCOM."},{"key":"e_1_3_2_2_16_1","unstructured":"SDX Central. [n. d.]. AT&T Runs Open Source White Box. https:\/\/www.sdxcentral.com\/articles\/news\/att-runs-open-source-white-box-switch-live-network\/2017\/04\/. ([n. d.]).  SDX Central. [n. d.]. AT&T Runs Open Source White Box. https:\/\/www.sdxcentral.com\/articles\/news\/att-runs-open-source-white-box-switch-live-network\/2017\/04\/. ([n. d.])."},{"key":"e_1_3_2_2_17_1","volume-title":"Yaron Koral, Jennifer Rexford, Ori Rottenstreich, Steven A Monetti, and Tzuu-Yi Wang.","author":"Chen Xiaoqi","year":"2019","unstructured":"Xiaoqi Chen , Shir Landau Feibish , Yaron Koral, Jennifer Rexford, Ori Rottenstreich, Steven A Monetti, and Tzuu-Yi Wang. 2019 . Fine-Grained Queue Measurement in the Data Plane. In ACM CoNEXT. Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, Jennifer Rexford, Ori Rottenstreich, Steven A Monetti, and Tzuu-Yi Wang. 2019. Fine-Grained Queue Measurement in the Data Plane. In ACM CoNEXT."},{"key":"e_1_3_2_2_18_1","volume-title":"PURR: A Primitive for Reconfigurable Fast Reroute. In ACM CoNEXT.","author":"Chiesa Marco","year":"2019","unstructured":"Marco Chiesa , Roshan Sedar , Gianni Antichi , Michael Borokhovich , Andrzej Kamisiundefinedski , Georgios Nikolaidis , and Stefan Schmid . 2019 . PURR: A Primitive for Reconfigurable Fast Reroute. In ACM CoNEXT. Marco Chiesa, Roshan Sedar, Gianni Antichi, Michael Borokhovich, Andrzej Kamisiundefinedski, Georgios Nikolaidis, and Stefan Schmid. 2019. PURR: A Primitive for Reconfigurable Fast Reroute. In ACM CoNEXT."},{"key":"e_1_3_2_2_19_1","unstructured":"Baek-Young Choi Sue Moon Rene Cruz Zhi-Li Zhang and Christophe Diot. 2007. Quantile Sampling for Practical Delay Monitoring in Internet Backbone Networks. Computer Networks.  Baek-Young Choi Sue Moon Rene Cruz Zhi-Li Zhang and Christophe Diot. 2007. Quantile Sampling for Practical Delay Monitoring in Internet Backbone Networks. Computer Networks."},{"key":"e_1_3_2_2_20_1","volume-title":"Estimating Logarithmic and Exponential Functions to Track Network Traffic Entropy in P4","author":"Ding Damu","unstructured":"Damu Ding , Marco Savi , and Domenico Siracusa . 2020. Estimating Logarithmic and Exponential Functions to Track Network Traffic Entropy in P4 . In IEEE\/IFIP NOMS. Damu Ding, Marco Savi, and Domenico Siracusa. 2020. Estimating Logarithmic and Exponential Functions to Track Network Traffic Entropy in P4. In IEEE\/IFIP NOMS."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347555"},{"key":"e_1_3_2_2_22_1","volume-title":"Why Flow-Completion Time is the Right Metric for Congestion Control. ACM SIGCOMM CCR","author":"Dukkipati Nandita","year":"2006","unstructured":"Nandita Dukkipati and Nick McKeown . 2006. Why Flow-Completion Time is the Right Metric for Congestion Control. ACM SIGCOMM CCR ( 2006 ). Nandita Dukkipati and Nick McKeown. 2006. Why Flow-Completion Time is the Right Metric for Congestion Control. ACM SIGCOMM CCR (2006)."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"David Felber and Rafail Ostrovsky. 2017. A Randomized Online Quantile Summary in O((1\/&epsis;) log(1\/&epsis;)) Words. In Theory of Computing.  David Felber and Rafail Ostrovsky. 2017. A Randomized Online Quantile Summary in O((1\/&epsis;) log(1\/&epsis;)) Words. In Theory of Computing.","DOI":"10.4086\/toc.2017.v013a014"},{"key":"e_1_3_2_2_24_1","volume-title":"Caching Algorithms and Self-organizing Search. Discrete Applied Mathematics","author":"Flajolet Philippe","year":"1992","unstructured":"Philippe Flajolet , Daniele Gardy , and Loys Thimonier . 1992. Birthday Paradox , Coupon Collectors , Caching Algorithms and Self-organizing Search. Discrete Applied Mathematics ( 1992 ). Philippe Flajolet, Daniele Gardy, and Loys Thimonier. 1992. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-organizing Search. Discrete Applied Mathematics (1992)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Alan Ford Costin Raiciu Mark J. Handley and Olivier Bonaventure. 2013. TCP Extensions for Multipath Operation with Multiple Addresses. (2013).  Alan Ford Costin Raiciu Mark J. Handley and Olivier Bonaventure. 2013. TCP Extensions for Multipath Operation with Multiple Addresses. (2013).","DOI":"10.17487\/rfc6824"},{"key":"e_1_3_2_2_26_1","volume-title":"SIMON: A Simple and Scalable Method for Sensing, Inference and Measurement in Data Center Networks. In USENIX NSDI.","author":"Geng Yilong","year":"2019","unstructured":"Yilong Geng , Shiyu Liu , Zi Yin , Ashish Naik , Balaji Prabhakar , Mendel Rosenblum , and Amin Vahdat . 2019 . SIMON: A Simple and Scalable Method for Sensing, Inference and Measurement in Data Center Networks. In USENIX NSDI. Yilong Geng, Shiyu Liu, Zi Yin, Ashish Naik, Balaji Prabhakar, Mendel Rosenblum, and Amin Vahdat. 2019. SIMON: A Simple and Scalable Method for Sensing, Inference and Measurement in Data Center Networks. In USENIX NSDI."},{"key":"e_1_3_2_2_27_1","volume-title":"On the Interplay of Link-Flooding Attacks and Traffic Engineering. ACM SIGCOMM CCR","author":"Gkounis Dimitrios","year":"2016","unstructured":"Dimitrios Gkounis , Vasileios Kotronis , Christos Liaskos , and Xenofontas Dimitropoulos . 2016. On the Interplay of Link-Flooding Attacks and Traffic Engineering. ACM SIGCOMM CCR ( 2016 ). Dimitrios Gkounis, Vasileios Kotronis, Christos Liaskos, and Xenofontas Dimitropoulos. 2016. On the Interplay of Link-Flooding Attacks and Traffic Engineering. ACM SIGCOMM CCR (2016)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787496"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486004"},{"key":"e_1_3_2_2_30_1","unstructured":"Nikhil Handigol Brandon Heller Vimalkumar Jeyakumar David Mazi\u00e8res and Nick McKeown. 2014. I Know What Your Packet Did Last Hop: Using Packet Histories to Troubleshoot Networks. In USENIX NSDI.  Nikhil Handigol Brandon Heller Vimalkumar Jeyakumar David Mazi\u00e8res and Nick McKeown. 2014. I Know What Your Packet Did Last Hop: Using Packet Histories to Troubleshoot Networks. In USENIX NSDI."},{"key":"e_1_3_2_2_31_1","unstructured":"Brandon Heller Srini Seetharaman Priya Mahadevan Yiannis Yiakoumis Puneet Sharma Sujata Banerjee and Nick McKeown. 2010. ElasticTree: Saving Energy in Data Center Networks. In USENIX NSDI.  Brandon Heller Srini Seetharaman Priya Mahadevan Yiannis Yiakoumis Puneet Sharma Sujata Banerjee and Nick McKeown. 2010. ElasticTree: Saving Energy in Data Center Networks. In USENIX NSDI."},{"key":"e_1_3_2_2_32_1","volume-title":"The Benefits of Coding over Routing in a Randomized Setting","author":"Ho T","unstructured":"T Ho , R Koetter , M Medard , DR Karger , and M Effros . 2003. The Benefits of Coding over Routing in a Randomized Setting . In IEEE ISIT. T Ho, R Koetter, M Medard, DR Karger, and M Effros. 2003. The Benefits of Coding over Routing in a Randomized Setting. In IEEE ISIT."},{"key":"e_1_3_2_2_33_1","unstructured":"IEEE. [n. d.]. Standard 802.3. https:\/\/standards.ieee.org\/standard\/802_3-2015.html. ([n. d.]).  IEEE. [n. d.]. Standard 802.3. https:\/\/standards.ieee.org\/standard\/802_3-2015.html. ([n. d.])."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Nikita Ivkin Zhuolong Yu Vladimir Braverman and Xin Jin. 2019. QPipe: Quantiles Sketch Fully in the Data Plane. In ACM CoNEXT.  Nikita Ivkin Zhuolong Yu Vladimir Braverman and Xin Jin. 2019. QPipe: Quantiles Sketch Fully in the Data Plane. In ACM CoNEXT.","DOI":"10.1145\/3359989.3365433"},{"key":"e_1_3_2_2_35_1","volume-title":"Tail Bounds for Sums of Geometric and Exponential Variables. Statistics & Probability Letters","author":"Janson Svante","year":"2018","unstructured":"Svante Janson . 2018. Tail Bounds for Sums of Geometric and Exponential Variables. Statistics & Probability Letters ( 2018 ). Svante Janson. 2018. Tail Bounds for Sums of Geometric and Exponential Variables. Statistics & Probability Letters (2018)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Vimalkumar Jeyakumar Mohammad Alizadeh Yilong Geng Changhoon Kim and David Mazi\u00e8res. 2014. Millions of Little Minions: Using Packets for Low Latency Network Programming and Visibility. In ACM SIGCOMM.  Vimalkumar Jeyakumar Mohammad Alizadeh Yilong Geng Changhoon Kim and David Mazi\u00e8res. 2014. Millions of Little Minions: Using Packets for Low Latency Network Programming and Visibility. In ACM SIGCOMM.","DOI":"10.1145\/2619239.2626292"},{"key":"e_1_3_2_2_37_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_38_1","volume-title":"Ben Leong, and Boon Thau Loo.","author":"Joshi Raj","year":"2018","unstructured":"Raj Joshi , Ting Qu , Mun Choon Chan , Ben Leong, and Boon Thau Loo. 2018 . BurstRadar: Practical Real-Time Microburst Monitoring for Datacenter Networks. In ACM APSys . Raj Joshi, Ting Qu, Mun Choon Chan, Ben Leong, and Boon Thau Loo. 2018. BurstRadar: Practical Real-Time Microburst Monitoring for Datacenter Networks. In ACM APSys."},{"key":"e_1_3_2_2_39_1","volume-title":"Optimal Quantile Approximation in Streams","author":"Karnin Zohar S.","unstructured":"Zohar S. Karnin , Kevin J. Lang , and Edo Liberty . 2016. Optimal Quantile Approximation in Streams . In IEEE FOCS. Zohar S. Karnin, Kevin J. Lang, and Edo Liberty. 2016. Optimal Quantile Approximation in Streams. In IEEE FOCS."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Dina Katabi Mark Handley and Charlie Rohrs. 2002. Congestion Control for High Bandwidth-Delay Product Networks. In ACM SIGCOMM.  Dina Katabi Mark Handley and Charlie Rohrs. 2002. Congestion Control for High Bandwidth-Delay Product Networks. In ACM SIGCOMM.","DOI":"10.1145\/633025.633035"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3143361.3143401"},{"key":"e_1_3_2_2_42_1","volume-title":"HULA: Scalable Load Balancing Using Programmable Data Planes. In ACM SOSR.","author":"Katta Naga","year":"2016","unstructured":"Naga Katta , Mukesh Hira , Changhoon Kim , Anirudh Sivaraman , and Jennifer Rexford . 2016 . HULA: Scalable Load Balancing Using Programmable Data Planes. In ACM SOSR. Naga Katta, Mukesh Hira, Changhoon Kim, Anirudh Sivaraman, and Jennifer Rexford. 2016. HULA: Scalable Load Balancing Using Programmable Data Planes. In ACM SOSR."},{"key":"e_1_3_2_2_43_1","volume-title":"Confluo: Distributed Monitoring and Diagnosis Stack for High-Speed Networks. In USENIX NSDI.","author":"Khandelwal Anurag","year":"2019","unstructured":"Anurag Khandelwal , Rachit Agarwal , and Ion Stoica . 2019 . Confluo: Distributed Monitoring and Diagnosis Stack for High-Speed Networks. In USENIX NSDI. Anurag Khandelwal, Rachit Agarwal, and Ion Stoica. 2019. Confluo: Distributed Monitoring and Diagnosis Stack for High-Speed Networks. In USENIX NSDI."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"e_1_3_2_2_45_1","unstructured":"Yuliang Li Rui Miao Changhoon Kim and Minlan Yu. 2016. FlowRadar: A Better NetFlow for Data Centers. In USENIX NSDI.  Yuliang Li Rui Miao Changhoon Kim and Minlan Yu. 2016. FlowRadar: A Better NetFlow for Data Centers. In USENIX NSDI."},{"key":"e_1_3_2_2_46_1","volume-title":"Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu.","author":"Li Yuliang","year":"2019","unstructured":"Yuliang Li , Rui Miao , Hongqiang Harry Liu , Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu. 2019 . HPCC : High Precision Congestion Control. In ACM SIGCOMM. Yuliang Li, Rui Miao, Hongqiang Harry Liu, Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, and Minlan Yu. 2019. HPCC: High Precision Congestion Control. In ACM SIGCOMM."},{"key":"e_1_3_2_2_47_1","unstructured":"Junda Liu Aurojit Panda Ankit Singla Brighten Godfrey Michael Schapira and Scott Shenker. 2013. Ensuring Connectivity via Data Plane Mechanisms. In USENIX NSDI.  Junda Liu Aurojit Panda Ankit Singla Brighten Godfrey Michael Schapira and Scott Shenker. 2013. Ensuring Connectivity via Data Plane Mechanisms. In USENIX NSDI."},{"key":"e_1_3_2_2_48_1","volume-title":"Lindsay","author":"Manku Gurmeet Singh","year":"1998","unstructured":"Gurmeet Singh Manku , Sridhar Rajagopalan , and Bruce G . Lindsay . 1998 . Approximate Medians and Other Quantiles in One Pass and with Limited Memory. In ACM SIGMOD. Gurmeet Singh Manku, Sridhar Rajagopalan, and Bruce G. Lindsay. 1998. Approximate Medians and Other Quantiles in One Pass and with Limited Memory. In ACM SIGMOD."},{"key":"e_1_3_2_2_49_1","volume-title":"Woodruff","author":"Mcgregor Andrew","year":"2016","unstructured":"Andrew Mcgregor , A. Pavan , Srikanta Tirthapura , and David P . Woodruff . 2016 . Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica ( 2016). Andrew Mcgregor, A. Pavan, Srikanta Tirthapura, and David P. Woodruff. 2016. Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica (2016)."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Ahmed Metwally Divyakant Agrawal and Amr El Abbadi. 2005. Efficient Computation of Frequent and Top-k Elements in Data Streams. In ICDT.  Ahmed Metwally Divyakant Agrawal and Amr El Abbadi. 2005. Efficient Computation of Frequent and Top-k Elements in Data Streams. In ICDT.","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Rui Miao Hongyi Zeng Changhoon Kim Jeongkeun Lee and Minlan Yu. 2017. SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs. In ACM SIGCOMM.  Rui Miao Hongyi Zeng Changhoon Kim Jeongkeun Lee and Minlan Yu. 2017. SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs. In ACM SIGCOMM.","DOI":"10.1145\/3098822.3098824"},{"key":"e_1_3_2_2_52_1","unstructured":"Mininet. [n. d.]. Mininet: An Instant Virtual Network on your Laptop. http:\/\/mininet.org\/. ([n. d.]).  Mininet. [n. d.]. Mininet: An Instant Virtual Network on your Laptop. http:\/\/mininet.org\/. ([n. d.])."},{"key":"e_1_3_2_2_53_1","unstructured":"Radhika Mittal Vinh The Lam Nandita Dukkipati Emily Blem Hassan Wassel Monia Ghobadi Amin Vahdat Yaogong Wang David Wetherall and David Zats. R@2015. TIMELY: RTT-Based Congestion Control for the Datacenter. In ACM SIGCOMM.  Radhika Mittal Vinh The Lam Nandita Dukkipati Emily Blem Hassan Wassel Monia Ghobadi Amin Vahdat Yaogong Wang David Wetherall and David Zats. R@2015. TIMELY: RTT-Based Congestion Control for the Datacenter. In ACM SIGCOMM."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"crossref","unstructured":"Radhika Mittal Alexander Shpiner Aurojit Panda Eitan Zahavi Arvind Krishnamurthy Sylvia Ratnasamy and Scott Shenker. 2018. Revisiting Network Support for RDMA. In ACM SIGCOMM.  Radhika Mittal Alexander Shpiner Aurojit Panda Eitan Zahavi Arvind Krishnamurthy Sylvia Ratnasamy and Scott Shenker. 2018. Revisiting Network Support for RDMA. In ACM SIGCOMM.","DOI":"10.1145\/3230543.3230557"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Robert Morris. 1978. Counting Large Numbers of Events in Small Registers. In Communications of ACM. ACM.  Robert Morris. 1978. Counting Large Numbers of Events in Small Registers. In Communications of ACM. ACM.","DOI":"10.1145\/359619.359627"},{"key":"e_1_3_2_2_56_1","volume-title":"Jennifer Rexford, and David Walker.","author":"Narayana Srinivas","year":"2016","unstructured":"Srinivas Narayana , Mina Tashmasbi Arashloo , Jennifer Rexford, and David Walker. 2016 . Compiling Path Queries. In USENIX NSDI. Srinivas Narayana, Mina Tashmasbi Arashloo, Jennifer Rexford, and David Walker. 2016. Compiling Path Queries. In USENIX NSDI."},{"key":"e_1_3_2_2_57_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_58_1","unstructured":"Netronome. [n. d.]. Netronome Agilio CX SmartNIC. https:\/\/www.netronome.com\/blog\/in-band-network-telemetry-its-not-rocket-science\/. ([n. d.]).  Netronome. [n. d.]. Netronome Agilio CX SmartNIC. https:\/\/www.netronome.com\/blog\/in-band-network-telemetry-its-not-rocket-science\/. ([n. d.])."},{"key":"e_1_3_2_2_59_1","unstructured":"Donald J Newman. 196"},{"key":"e_1_3_2_2_60_1","volume-title":"OFLOPS-SUME and the art of switch characterization","author":"Oudin Remi","year":"2019","unstructured":"Remi Oudin , Gianni Antichi , Charalampos Rotsos , Andrew W. Moore , and Steve Uhlig . 2019. OFLOPS-SUME and the art of switch characterization . IEEE JSAC ( 2019 ). Remi Oudin, Gianni Antichi, Charalampos Rotsos, Andrew W. Moore, and Steve Uhlig. 2019. OFLOPS-SUME and the art of switch characterization. IEEE JSAC (2019)."},{"key":"e_1_3_2_2_61_1","volume-title":"Moore","author":"Popescu Diana","year":"2017","unstructured":"Diana Popescu , Noa Zilberman , and Andrew W . Moore . 2017 . Characterizing the Impact of Network Latency on Cloud-based Applications' Performance. In Technical Report, Number 914, UCAM-CL-TR-914. University of Cambridge . Diana Popescu, Noa Zilberman, and Andrew W. Moore. 2017. Characterizing the Impact of Network Latency on Cloud-based Applications' Performance. In Technical Report, Number 914, UCAM-CL-TR-914. University of Cambridge."},{"key":"e_1_3_2_2_62_1","volume-title":"Snoeren","author":"Roy Arjun","year":"2015","unstructured":"Arjun Roy , Hongyi Zeng , Jasmeet Bagga , George Porter , and Alex C . Snoeren . 2015 . Inside the Social Network's (Datacenter) Network. In ACM SIGCOMM. Arjun Roy, Hongyi Zeng, Jasmeet Bagga, George Porter, and Alex C. Snoeren. 2015. Inside the Social Network's (Datacenter) Network. In ACM SIGCOMM."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487682"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Stefan Savage David Wetherall Anna Karlin and Tom Anderson. 2000. Practical Network Support for IP Traceback. In ACM SIGCOMM.  Stefan Savage David Wetherall Anna Karlin and Tom Anderson. 2000. Practical Network Support for IP Traceback. In ACM SIGCOMM.","DOI":"10.1145\/347059.347560"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"crossref","unstructured":"Robert Schweller Ashish Gupta Elliot Parsons and Yan Chen. 2004. Reversible Sketches for Efficient and Accurate Change Detection over Network Data Streams. In ACM IMC.  Robert Schweller Ashish Gupta Elliot Parsons and Yan Chen. 2004. Reversible Sketches for Efficient and Accurate Change Detection over Network Data Streams. In ACM IMC.","DOI":"10.1145\/1028788.1028814"},{"key":"e_1_3_2_2_67_1","unstructured":"Naveen Kr. Sharma Antoine Kaufmann Thomas Anderson Arvind Krishnamurthy Jacob Nelson and Simon Peter. 2017. Evaluating the Power of Flexible Packet Processing for Network Resource Allocation. In USENIX NSDI.  Naveen Kr. Sharma Antoine Kaufmann Thomas Anderson Arvind Krishnamurthy Jacob Nelson and Simon Peter. 2017. Evaluating the Power of Flexible Packet Processing for Network Resource Allocation. In USENIX NSDI."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Anirudh Sivaraman Changhoon Kim Ramkumar Krishnamoorthy Advait Dixit and Mihai Budiu. 2015. DC.P4: Programming the Forwarding Plane of a Datacenter Switch. In ACM SOSR.  Anirudh Sivaraman Changhoon Kim Ramkumar Krishnamoorthy Advait Dixit and Mihai Budiu. 2015. DC.P4: Programming the Forwarding Plane of a Datacenter Switch. In ACM SOSR.","DOI":"10.1145\/2774993.2775007"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Alex C. Snoeren Craig Partridge Luis A. Sanchez Christine E. Jones Fabrice Tchakountio Stephen T. Kent and W. Timothy Strayer. 2001. Hash-based IP Traceback. In ACM SIGCOMM.  Alex C. Snoeren Craig Partridge Luis A. Sanchez Christine E. Jones Fabrice Tchakountio Stephen T. Kent and W. Timothy Strayer. 2001. Hash-based IP Traceback. In ACM SIGCOMM.","DOI":"10.1145\/964723.383060"},{"key":"e_1_3_2_2_70_1","volume-title":"Advanced and Authenticated Marking Schemes for IP Traceback","author":"Song Dawn Xiaodong","unstructured":"Dawn Xiaodong Song and Adrian Perrig . 2001. Advanced and Authenticated Marking Schemes for IP Traceback . In IEEE INFOCOM. Dawn Xiaodong Song and Adrian Perrig. 2001. Advanced and Authenticated Marking Schemes for IP Traceback. In IEEE INFOCOM."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Philip Taffet and John Mellor-Crummey. 2019. Understanding Congestion in High Performance Interconnection Networks Using Sampling. In ACM SC.  Philip Taffet and John Mellor-Crummey. 2019. Understanding Congestion in High Performance Interconnection Networks Using Sampling. In ACM SC.","DOI":"10.1145\/3295500.3356168"},{"key":"e_1_3_2_2_72_1","unstructured":"Praveen Tammana Rachit Agarwal and Myungjin Lee. 2016. Simplifying Datacenter Network Debugging with Pathdump. In USENIX OSDI.  Praveen Tammana Rachit Agarwal and Myungjin Lee. 2016. Simplifying Datacenter Network Debugging with Pathdump. In USENIX OSDI."},{"key":"e_1_3_2_2_73_1","unstructured":"Praveen Tammana Rachit Agarwal and Mjungjin Lee. 2018. Distributed Network Monitoring and Debugging with SwitchPointer. In USENIX NSDI.  Praveen Tammana Rachit Agarwal and Mjungjin Lee. 2018. Distributed Network Monitoring and Debugging with SwitchPointer. In USENIX NSDI."},{"key":"e_1_3_2_2_74_1","volume-title":"Netbouncer: Active Device and Link Failure Localization in Data Center Networks. In USENIX NSDI.","author":"Tan Cheng","year":"2019","unstructured":"Cheng Tan , Ze Jin , Chuanxiong Guo , Tianrong Zhang , Haitao Wu , Karl Deng , Dongming Bi , and Dong Xiang . 2019 . Netbouncer: Active Device and Link Failure Localization in Data Center Networks. In USENIX NSDI. Cheng Tan, Ze Jin, Chuanxiong Guo, Tianrong Zhang, Haitao Wu, Karl Deng, Dongming Bi, and Dong Xiang. 2019. Netbouncer: Active Device and Link Failure Localization in Data Center Networks. In USENIX NSDI."},{"key":"e_1_3_2_2_75_1","unstructured":"The P4.org Applications Working Group. [n. d.]. In-band Network Telemetry (INT) Dataplane Specification. https:\/\/github.com\/p4lang\/p4-applications\/blob\/master\/docs\/telemetry_report.pdf. ([n. d.]).  The P4.org Applications Working Group. [n. d.]. In-band Network Telemetry (INT) Dataplane Specification. https:\/\/github.com\/p4lang\/p4-applications\/blob\/master\/docs\/telemetry_report.pdf. ([n. d.])."},{"key":"e_1_3_2_2_76_1","unstructured":"The University of Washington NS-3 Consortium. [n. d.]. NS3 official website. https:\/\/www.nsnam.org\/. ([n. d.]).  The University of Washington NS-3 Consortium. [n. d.]. NS3 official website. https:\/\/www.nsnam.org\/. ([n. d.])."},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832197"},{"key":"e_1_3_2_2_78_1","volume-title":"Stroboscope: Declarative Network Monitoring on a Budget. In USENIX NSDI.","author":"Tilmans Olivier","year":"2018","unstructured":"Olivier Tilmans , Tobias B\u00fchler , Ingmar Poese , Stefano Vissicchio , and Laurent Vanbever . 2018 . Stroboscope: Declarative Network Monitoring on a Budget. In USENIX NSDI. Olivier Tilmans, Tobias B\u00fchler, Ingmar Poese, Stefano Vissicchio, and Laurent Vanbever. 2018. Stroboscope: Declarative Network Monitoring on a Budget. In USENIX NSDI."},{"key":"e_1_3_2_2_79_1","volume-title":"Jiaqi Gao, and Minlan Yu.","author":"Tirmazi Muhammad Tirmazi","year":"2020","unstructured":"Muhammad Tirmazi Tirmazi , Ran Ben Basat , Jiaqi Gao, and Minlan Yu. 2020 . Cheetah : Accelerating Database Queries with Switch Pruning. In ACM SIGMOD. Muhammad Tirmazi Tirmazi, Ran Ben Basat, Jiaqi Gao, and Minlan Yu. 2020. Cheetah: Accelerating Database Queries with Switch Pruning. In ACM SIGMOD."},{"key":"e_1_3_2_2_80_1","unstructured":"P Van Mieghem Gerard Hooghiemstra and Remco Hofstad. 2001. A scaling law for the hopcount in Internet. In PAM.  P Van Mieghem Gerard Hooghiemstra and Remco Hofstad. 2001. A scaling law for the hopcount in Internet. In PAM."},{"key":"e_1_3_2_2_81_1","volume-title":"On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Measures of Complexity","author":"Vapnik Vladimir N","year":"2015","unstructured":"Vladimir N Vapnik and A Ya Chervonenkis . 2015. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Measures of Complexity ( 2015 ). Vladimir N Vapnik and A Ya Chervonenkis. 2015. On the Uniform Convergence of Relative Frequencies of Events to their Probabilities. Measures of Complexity (2015)."},{"key":"e_1_3_2_2_82_1","volume-title":"Random Sampling with a Reservoir. Transactions on Mathematical Software","author":"Vitter Jeffrey S","year":"1985","unstructured":"Jeffrey S Vitter . 1985. Random Sampling with a Reservoir. Transactions on Mathematical Software ( 1985 ). Jeffrey S Vitter. 1985. Random Sampling with a Reservoir. Transactions on Mathematical Software (1985)."},{"key":"e_1_3_2_2_83_1","unstructured":"Xilinx. [n. d.]. 10G\/25G Ethernet Subsystem. https:\/\/www.xilinx.com\/products\/intellectual-property\/ef-di-25gemac.html. ([n. d.]).  Xilinx. [n. d.]. 10G\/25G Ethernet Subsystem. https:\/\/www.xilinx.com\/products\/intellectual-property\/ef-di-25gemac.html. ([n. d.])."},{"key":"e_1_3_2_2_84_1","unstructured":"Xilinx. [n. d.]. UltraScale Integrated 100G Ethernet Subsystem. https:\/\/www.xilinx.com\/products\/intellectual-property\/cmac.html. ([n. d.]).  Xilinx. [n. d.]. UltraScale Integrated 100G Ethernet Subsystem. https:\/\/www.xilinx.com\/products\/intellectual-property\/cmac.html. ([n. d.])."},{"key":"e_1_3_2_2_85_1","unstructured":"Xilinx. [n. d.]. Xilinx to Showcase Unprecedented Programmability and Visibility. https:\/\/www.xilinx.com\/news\/press\/2018\/barefoot-networks-and-xilinx.html. ([n. d.]).  Xilinx. [n. d.]. Xilinx to Showcase Unprecedented Programmability and Visibility. https:\/\/www.xilinx.com\/news\/press\/2018\/barefoot-networks-and-xilinx.html. ([n. d.])."},{"key":"e_1_3_2_2_86_1","unstructured":"Minlan Yu Lavanya Jose and Rui Miao. 2013. Software Defined Traffic Measurement with OpenSketch. In USENIX NSDI.  Minlan Yu Lavanya Jose and Rui Miao. 2013. Software Defined Traffic Measurement with OpenSketch. In USENIX NSDI."},{"key":"e_1_3_2_2_87_1","doi-asserted-by":"crossref","unstructured":"Yibo Zhu Nanxi Kang Jiaxin Cao Albert Greenberg Guohan Lu Ratul Mahajan Dave Maltz Lihua Yuan Ming Zhang Ben Y. Zhao and Haitao Zheng. 2015. Packet-Level Telemetry in Large Datacenter Networks. In ACM SIGCOMM.  Yibo Zhu Nanxi Kang Jiaxin Cao Albert Greenberg Guohan Lu Ratul Mahajan Dave Maltz Lihua Yuan Ming Zhang Ben Y. Zhao and Haitao Zheng. 2015. Packet-Level Telemetry in Large Datacenter Networks. In ACM SIGCOMM.","DOI":"10.1145\/2785956.2787483"}],"event":{"name":"SIGCOMM '20: Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication","location":"Virtual Event USA","acronym":"SIGCOMM '20","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405894","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405894","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3387514.3405894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:36Z","timestamp":1750200096000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3387514.3405894"}},"subtitle":["Probabilistic In-band Network Telemetry"],"short-title":[],"issued":{"date-parts":[[2020,7,30]]},"references-count":86,"alternative-id":["10.1145\/3387514.3405894","10.1145\/3387514"],"URL":"https:\/\/doi.org\/10.1145\/3387514.3405894","relation":{},"subject":[],"published":{"date-parts":[[2020,7,30]]},"assertion":[{"value":"2020-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}