{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:20:48Z","timestamp":1756635648002,"version":"3.44.0"},"reference-count":62,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2023,12,7]]},"abstract":"<jats:p>As networks get more complex, the ability to track almost all the flows is becoming of paramount importance. This is because we can then detect transient events impacting only a subset of the traffic. Solutions for flow monitoring exist, but it is getting very difficult to produce accurate estimations for every &lt;flowID,counter&gt; tuple given the memory constraints of commodity programmable switches. Indeed, as networks grow in size, more flows have to be tracked, increasing the number of tuples to be recorded. At the same time, end-host virtualization requires more specific flowIDs, enlarging the memory cost for every single entry. Finally, the available memory resources have to be shared with other important functions as well (e.g., load balancing, forwarding, ACL).<\/jats:p>\n          <jats:p>To address those issues, we present FlowLiDAR (Flow Lightweight Detection and Ranging), a new solution that is capable of tracking almost all the flows in the network while requiring only a modest amount of data plane memory which is not dependent on the size of flowIDs. We implemented the scheme in P4, tested it using real traffic from ISPs and compared it against four state-of-the-art solutions: FlowRadar, NZE, PR-sketch, and Elastic Sketch. While those can only reconstruct up to 60% of the tuples, FlowLiDAR can track 98.7% of them with the same amount of memory.<\/jats:p>","DOI":"10.1145\/3626775","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T15:20:29Z","timestamp":1702394429000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Lightweight Acquisition and Ranging of Flows in the Data Plane"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7584-8952","authenticated-orcid":false,"given":"Andrea","family":"Monterubbiano","sequence":"first","affiliation":[{"name":"University of Rome - Sapienza, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0644-6612","authenticated-orcid":false,"given":"Jonatan","family":"Langlet","sequence":"additional","affiliation":[{"name":"Queen Mary University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6477-0106","authenticated-orcid":false,"given":"Stefan","family":"Walzer","sequence":"additional","affiliation":[{"name":"Cologne University, Cologne, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6063-4975","authenticated-orcid":false,"given":"Gianni","family":"Antichi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano &amp; Queen Mary University of London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2540-5234","authenticated-orcid":false,"given":"Pedro","family":"Reviriego","sequence":"additional","affiliation":[{"name":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3626-6404","authenticated-orcid":false,"given":"Salvatore","family":"Pontarelli","sequence":"additional","affiliation":[{"name":"University of Rome - Sapienza, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/HCS49909.2020.9220636"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373360.3380834"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3484266.3487379"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2982739"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405894"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462043"},{"key":"e_1_2_1_8_1","unstructured":"Caida. 2016. The CAIDA UCSD Anonymized Internet Traces. http:\/\/www.caida.org\/data\/passive\/passive_2016_dataset.xml."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294281"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3034890"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_19"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1182002"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20426"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405867"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-38851-9_23"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230555"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098825"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--57899--4_49"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"J. Hill M. Aloserij and P. Grosso. 2018. Tracking Network Flows with P4. In IEEE\/ACM Innovating the Network for Data-Intensive Science (INDIS).","DOI":"10.1109\/INDIS.2018.00006"},{"key":"e_1_2_1_23_1","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Huang Qun","year":"2021","unstructured":"Qun Huang, Siyuan Sheng, Xiang Chen, Yungang Bao, Rui Zhang, Yanwei Xu, and Gong Zhang. 2021. Toward Nearly-Zero-Error Sketching via Compressive Sensing. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21). 1027--1044."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405877"},{"key":"e_1_2_1_25_1","unstructured":"Intel. 2021. Intel Deep Insight Network Analytics Software. https:\/\/www.intel.com\/content\/www\/us\/en\/products\/network-io\/programmable-ethernet-switch\/network-analytics\/deep-insight.html. Accessed: 2022--10-04."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132764"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.12.016"},{"key":"e_1_2_1_28_1","volume-title":"HULA: Scalable Load Balancing Using Programmable Data Planes. In Symposium on SDN Research (SOSR). ACM.","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 Symposium on SDN Research (SOSR). ACM."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the ACM Conference on Special Interest Group on Data Communication (SIGCOMM).","author":"Kim Changhoon","year":"2015","unstructured":"Changhoon Kim, Anirudh Sivaraman, Naga Katta, Antonin Bas, Advait Dixit, and Lawrence J Wobker. 2015. In-band network telemetry via programmable dataplanes. In Proceedings of the ACM Conference on Special Interest Group on Data Communication (SIGCOMM)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405855"},{"volume-title":"Data Streaming Algorithms for Efficient and Accurate Estimation of Flow Size Distribution","author":"Kumar Abhishek","key":"e_1_2_1_31_1","unstructured":"Abhishek Kumar, Minho Sung, Jun (Jim) Xu, and Jia Wang. 2004. Data Streaming Algorithms for Efficient and Accurate Estimation of Flow Size Distribution. In Special Interest Group for the Computer Performance Evaluation (SIGMETRICS). ACM."},{"key":"e_1_2_1_32_1","volume-title":"Detecting Routing Loops in the Data Plane. In Conference on Emerging Networking EXperiments and Technologies (CoNEXT). ACM.","author":"Kuvcera Jan","year":"2020","unstructured":"Jan Kuvcera, Ran Ben Basat, M\u00e1rio Kuka, Gianni Antichi, Minlan Yu, and Michael Mitzenmacher. 2020. Detecting Routing Loops in the Data Plane. In Conference on Emerging Networking EXperiments and Technologies (CoNEXT). ACM."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251110"},{"key":"e_1_2_1_34_1","unstructured":"Yuliang Li Rui Miao Changhoon Kim and Minlan Yu. 2016a. FlowRadar: A Better NetFlow for Data Centers. In USENIX NSDI."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2999572.2999609"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342085"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2889329"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_2_1_40_1","volume-title":"International conference on database theory. Springer, 398--412","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. 2005. Efficient computation of frequent and top-k elements in data streams. In International conference on database theory. Springer, 398--412."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098824"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20061"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN.2017.8169867"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000097"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2013.11.015"},{"key":"e_1_2_1_46_1","volume-title":"Scaling Distributed Machine Learning with In-Network Aggregation. In Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association.","author":"Sapio Amedeo","year":"2021","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 Symposium on Networked Systems Design and Implementation (NSDI). USENIX Association."},{"key":"e_1_2_1_47_1","unstructured":"Mariano Scazzariello Tommaso Caiazzi Hamid Ghasemirahni Tom Barbette Dejan Kostic and Marco Chiesa. 2023. A High-Speed Stateful Packet Processing Approach for Tbps Programmable Switches. In Networked Systems Design and Implementation (NSDI). USENIX."},{"key":"e_1_2_1_48_1","volume-title":"Reversible Sketches: Enabling Monitoring and Analysis over High-Speed Data Streams. In Transactions on Networking, Volume: 15, Issue: 5","author":"Schweller Robert","year":"2007","unstructured":"Robert Schweller, Zhichun Li, Yan Chen, Yan Gao, Ashish Gupta, Yin Zhang, Peter A. Dinda, Ming-Yang Kao, and Gokhan Memik. 2007. Reversible Sketches: Enabling Monitoring and Analysis over High-Speed Data Streams. In Transactions on Networking, Volume: 15, Issue: 5. IEEE Press."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467868"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190558"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219975"},{"key":"e_1_2_1_52_1","volume-title":"2017 19th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 76--81","author":"Tu Nguyen Van","year":"2017","unstructured":"Nguyen Van Tu, Jonghwan Hyun, and James Won-Ki Hong. 2017. Towards onos-based sdn monitoring using in-band network telemetry. In 2017 19th Asia-Pacific Network Operations and Management Symposium (APNOMS). IEEE, 76--81."},{"key":"e_1_2_1_53_1","volume-title":"FlowMap: A Fine-Grained Flow Measurement Approach for Data-Center Networks. In ICC 2019--2019 IEEE International Conference on Communications (ICC). IEEE, 1--7.","author":"Wang Xiong","year":"2019","unstructured":"Xiong Wang, Hanyu Liu, Jun Zhang, Jing Ren, Sheng Wang, and Shizhong Xu. 2019. FlowMap: A Fine-Grained Flow Measurement Approach for Data-Center Networks. In ICC 2019--2019 IEEE International Conference on Communications (ICC). IEEE, 1--7."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2933868"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314212.3314215"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583147"},{"key":"e_1_2_1_58_1","volume-title":"Joint Data Streaming and Sampling Techniques for Detection of Super Sources and Destinations. In Conference on Internet Measurement (IMC). USENIX Association.","author":"Zhao Qi","year":"2005","unstructured":"Qi Zhao, Abhishek Kumar, and Jun Xu. 2005. Joint Data Streaming and Sampling Techniques for Detection of Super Sources and Destinations. In Conference on Internet Measurement (IMC). USENIX Association."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3099442"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2986690"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3406214"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787483"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:15:26Z","timestamp":1755908126000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12,7]]}},"alternative-id":["10.1145\/3626775"],"URL":"https:\/\/doi.org\/10.1145\/3626775","relation":{},"ISSN":["2476-1249"],"issn-type":[{"type":"electronic","value":"2476-1249"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"2023-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}