{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:26Z","timestamp":1774732046954,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:00:00Z","timestamp":1726444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FWO","award":["G0E0719N"],"award-info":[{"award-number":["G0E0719N"]}]},{"DOI":"10.13039\/501100001711","name":"SNSF","doi-asserted-by":"crossref","award":["200021L_182005"],"award-info":[{"award-number":["200021L_182005"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Cybersecurity Research Flanders","award":["VR20192203"],"award-info":[{"award-number":["VR20192203"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>Network flow measurement is an integral part of modern high-speed applications for network security and data-stream processing. However, processing at line rate while maintaining the required data structure within the on-chip memory of the hardware platform is a challenging task for measurement algorithms, especially when accuracy is of primary importance, such as in network security applications. Most of the existing measurement algorithms are no exception to such issues when deployed in high-speed networking environments and are also not tailored for efficient hardware implementation. Sketch-based measurement algorithms minimize the memory requirement and are suitable for high-speed networks but possess a low memory-accuracy trade-off and lack the versatility of individual flow mapping. To address these challenges, we present a hardware-friendly data structure named Sketch-based Pseudo-associative array Architecture (SPArch). SPArch is highly accurate and extremely memory-efficient, making it suitable for network flow measurement and security applications. The parallelism in SPArch ensures minimal and constant memory access cycles. Unlike other sketch architectures, SPArch provides the functionality of individual flow mapping similar to associative arrays, and the optimized version of SPArch allows the organization of counters in multiple buckets based on the flow sizes. An in-depth analysis of SPArch is carried out in this article and implemented SPArch on the Alveo data center accelerator card, demonstrating its suitability for high-speed networks.<\/jats:p>","DOI":"10.1145\/3687477","type":"journal-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T11:14:18Z","timestamp":1723115658000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["SPArch: A Hardware-oriented Sketch-based Architecture for High-speed Network Flow Measurements"],"prefix":"10.1145","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8197-0097","authenticated-orcid":false,"given":"Arish","family":"Sateesan","sequence":"first","affiliation":[{"name":"ES&amp;S-COSIC, ESAT, KU Leuven, Leuven, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4258-2208","authenticated-orcid":false,"given":"Jo","family":"Vliegen","sequence":"additional","affiliation":[{"name":"ES&amp;S-COSIC, ESAT, KU Leuven, Leuven Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9557-1700","authenticated-orcid":false,"given":"Simon","family":"Scherrer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Zurich Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9592-6911","authenticated-orcid":false,"given":"Hsu-Chun","family":"Hsiao","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei Taiwan and Academia Sinica, Taipei Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5280-5412","authenticated-orcid":false,"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8753-7895","authenticated-orcid":false,"given":"Nele","family":"Mentens","sequence":"additional","affiliation":[{"name":"ES&amp;S-COSIC, ESAT, KU Leuven, Leuven Belgium and LIACS, Leiden University, Leiden, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,16]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/1879141.1879175","volume-title":"Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (IMC\u201910)","author":"Benson Theophilus","year":"2010","unstructured":"Theophilus Benson, Aditya Akella, and David A. Maltz. 2010. Network traffic characteristics of data centers in the wild. In Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement (IMC\u201910). Association for Computing Machinery, New York, NY, 267\u2013280."},{"key":"e_1_3_1_3_2","article-title":"Passive OC48 and OC192 Traces","author":"CAIDA The Center for Applied Internet Data Analysis","year":"2018","unstructured":"The Center for Applied Internet Data Analysis CAIDA. 2018. Passive OC48 and OC192 Traces. Retrieved from https:\/\/www.caida.org\/data\/passive\/trace_stats\/nyc-B\/2018\/?monitor=20181018-130000.UTC. Accessed: 2023.","journal-title":"R"},{"key":"e_1_3_1_4_2","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"Charikar Moses","year":"2002","unstructured":"Moses Charikar, Kevin Chen, and Martin Farach-Colton. 2002. Finding frequent items in data streams. In Automata, Languages and Programming. Springer, Berlin, 693\u2013703."},{"issue":"2","key":"e_1_3_1_5_2","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/TNET.2016.2621159","article-title":"Counter tree: A scalable counter architecture for per-flow traffic measurement","volume":"25","author":"Chen Min","year":"2017","unstructured":"Min Chen, Shigang Chen, and Zhiping Cai. 2017. Counter tree: A scalable counter architecture for per-flow traffic measurement. IEEE\/ACM Trans. Netw. 25, 2 (2017), 1249\u20131262.","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"e_1_3_1_6_2","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MM.2018.022071131","article-title":"Serving DNNs in real time at datacenter scale with project brainwave","volume":"38","author":"Chung Eric","year":"2018","unstructured":"Eric Chung, Jeremy Fowers, Kalin Ovtcharov, Michael Papamichael, Adrian Caulfield, Todd Massengill, Ming Liu, Daniel Lo, Shlomi Alkalay, Michael Haselman et\u00a0al. 2018. Serving DNNs in real time at datacenter scale with project brainwave. IEEE Micro 38, 2 (2018), 8\u201320.","journal-title":"IEEE Micro"},{"key":"e_1_3_1_7_2","article-title":"CISCO IOS NetFlow Version 9","year":"2015","unstructured":"CISCO. 2015. CISCO IOS NetFlow Version 9. Retrieved from http:\/\/www.cisco.com\/c\/en\/us\/products\/ios-nx-os-software\/netflow-version-9\/index.html. Accessed: 2023.","journal-title":"R"},{"issue":"1","key":"e_1_3_1_8_2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","article-title":"An improved data stream summary: The count-min sketch and its applications.","volume":"55","author":"Cormode G.","year":"2005","unstructured":"G. Cormode and S. Muthukrishnan. 2005. An improved data stream summary: The count-min sketch and its applications. J. Algor. 55, 1 (2005), 58\u201375.","journal-title":"J. Algor."},{"key":"e_1_3_1_9_2","first-page":"2560","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201915)","author":"Einziger Gil","year":"2015","unstructured":"Gil Einziger, Benny Fellman, and Yaron Kassner. 2015. Independent counter estimation buckets. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201915). 2560\u20132568."},{"issue":"3","key":"e_1_3_1_10_2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/859716.859719","article-title":"New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice","volume":"21","author":"Estan Cristian","year":"2003","unstructured":"Cristian Estan and George Varghese. 2003. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans. Comput. Syst. 21, 3 (Aug. 2003), 270\u2013313.","journal-title":"ACM Trans. Comput. Syst."},{"key":"e_1_3_1_11_2","article-title":"DDoS Evaluation Dataset (CIC-DDoS2019)","author":"(CIC) The Canadian Institute for Cybersecurity","year":"2019","unstructured":"The Canadian Institute for Cybersecurity (CIC). 2019. DDoS Evaluation Dataset (CIC-DDoS2019). Retrieved from https:\/\/www.unb.ca\/cic\/datasets\/ddos-2019.html. Accessed: 2024.","journal-title":"R"},{"key":"e_1_3_1_12_2","first-page":"909","volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201918)","author":"Gong Junzhi","year":"2018","unstructured":"Junzhi Gong, Tong Yang, Haowei Zhang, Hao Li, Steve Uhlig, Shigang Chen, Lorna Uden, and Xiaoming Li. 2018. HeavyKeeper: An accurate algorithm for finding Top-k elephant flows. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201918). USENIX Association, Boston, MA, 909\u2013921."},{"key":"e_1_3_1_13_2","first-page":"495","volume-title":"Proceedings of the IEEE Real-Time Systems Symposium (RTSS\u201918)","author":"Hassan Mohamed","year":"2018","unstructured":"Mohamed Hassan. 2018. On the off-chip memory latency of real-time systems: Is DDR DRAM really the best option? In Proceedings of the IEEE Real-Time Systems Symposium (RTSS\u201918). 495\u2013505."},{"key":"e_1_3_1_14_2","first-page":"665","volume-title":"Proceedings of the IEEE 30th International Conference on Distributed Computing Systems","author":"Hu Chengchen","year":"2010","unstructured":"Chengchen Hu, Bin Liu, Hongbo Zhao, Kai Chen, Yan Chen, Chunming Wu, and Yu Cheng. 2010. DISCO: Memory efficient and accurate flow statistics for network measurement. In Proceedings of the IEEE 30th International Conference on Distributed Computing Systems. 665\u2013674."},{"key":"e_1_3_1_15_2","first-page":"26","volume-title":"Proceedings of the 27th IEEE Conference on Computer Communications (INFOCOM\u201908)","author":"Hu C.","year":"2008","unstructured":"C. Hu, S. Wang, J. Tian, B. Liu, Y. Cheng, and Y. Chen. 2008. Accurate and efficient traffic monitoring using adaptive non-linear sampling method. In Proceedings of the 27th IEEE Conference on Computer Communications (INFOCOM\u201908). 26\u201330."},{"key":"e_1_3_1_16_2","first-page":"89","volume-title":"Proceedings of the 4th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS\u201908)","author":"Hua Nan","year":"2008","unstructured":"Nan Hua, Bill Lin, Jun (Jim) Xu, and Haiquan (Chuck) Zhao. 2008. BRICK: A novel exact active statistics counter architecture. In Proceedings of the 4th ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS\u201908). Association for Computing Machinery, New York, NY, 89\u201398."},{"key":"e_1_3_1_17_2","article-title":"Count-less: A counting sketch for the data plane of high-speed switches","author":"Kim SunYoung","year":"2021","unstructured":"SunYoung Kim, Changhun Jung, RhongHo Jang, David Mohaisen, and DaeHun Nyang. 2021. Count-less: A counting sketch for the data plane of high-speed switches. Retrieved from https:\/\/arXiv:2111.02759","journal-title":"R"},{"key":"e_1_3_1_18_2","first-page":"311","volume-title":"Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201916)","author":"Li Yuliang","year":"2016","unstructured":"Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. 2016. FlowRadar: A better NetFlow for data centers. In Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI\u201916). USENIX Association, Santa Clara, CA, 311\u2013324."},{"key":"e_1_3_1_19_2","first-page":"1","volume-title":"Proceedings of the 35th Annual IEEE International Conference on Computer Communications (INFOCOM\u201916)","author":"Li Yang","year":"2016","unstructured":"Yang Li, Hao Wu, Tian Pan, Huichen Dai, Jianyuan Lu, and Bin Liu. 2016. CASE: Cache-assisted stretchable estimator for high-speed per-flow measurement. In Proceedings of the 35th Annual IEEE International Conference on Computer Communications (INFOCOM\u201916). IEEE Press, 1\u20139."},{"key":"e_1_3_1_20_2","first-page":"101","volume-title":"Proceedings of the ACM SIGCOMM Conference (SIGCOMM\u201916)","author":"Liu Zaoxing","year":"2016","unstructured":"Zaoxing Liu, Antonis Manousis, Gregory Vorsanger, Vyas Sekar, and Vladimir Braverman. 2016. One sketch to rule them all: Rethinking network flow monitoring with UnivMon. In Proceedings of the ACM SIGCOMM Conference (SIGCOMM\u201916). Association for Computing Machinery, New York, NY, 101\u2013114."},{"key":"e_1_3_1_21_2","first-page":"522","volume-title":"Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM\u201909)","author":"Lu Y.","year":"2009","unstructured":"Y. Lu and B. Prabhakar. 2009. Robust counting via counter braids: An error-resilient network measurement architecture. In Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM\u201909). 522\u2013530."},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/B978-155860869-6\/50038-X","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases (VLDB\u201902)","author":"Manku Gurmeet Singh","year":"2002","unstructured":"Gurmeet Singh Manku and Rajeev Motwani. 2002. Approximate frequency counts over data streams. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB\u201902). VLDB Endowment, 346\u2013357."},{"key":"e_1_3_1_23_2","first-page":"398","volume-title":"Proceedings of the 10th International Conference on Database Theory (ICDT\u201905)","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 Proceedings of the 10th International Conference on Database Theory (ICDT\u201905). Springer-Verlag, Berlin, 398\u2013412."},{"issue":"10","key":"e_1_3_1_24_2","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/359619.359627","article-title":"Counting large numbers of events in small registers","volume":"21","author":"Morris Robert","year":"1978","unstructured":"Robert Morris. 1978. Counting large numbers of events in small registers. Commun. ACM 21, 10 (Oct. 1978), 840\u2013842.","journal-title":"Commun. ACM"},{"issue":"3","key":"e_1_3_1_25_2","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MM.2015.42","article-title":"A reconfigurable fabric for accelerating large-scale datacenter services","volume":"35","author":"Putnam Andrew","year":"2015","unstructured":"Andrew Putnam, Adrian M. Caulfield, Eric S. Chung, Derek Chiou, Kypros Constantinides, John Demme, Hadi Esmaeilzadeh, Jeremy Fowers, Gopi Prashanth Gopal, Jan Gray, et\u00a0al. 2015. A reconfigurable fabric for accelerating large-scale datacenter services. IEEE Micro 35, 3 (2015), 10\u201322.","journal-title":"IEEE Micro"},{"key":"e_1_3_1_26_2","first-page":"1449","volume-title":"Proceedings of the International Conference on Management of Data (SIGMOD\u201916)","author":"Roy Pratanu","year":"2016","unstructured":"Pratanu Roy, Arijit Khan, and Gustavo Alonso. 2016. Augmented sketch: Faster and more accurate stream processing. In Proceedings of the International Conference on Management of Data (SIGMOD\u201916). Association for Computing Machinery, New York, NY, 1449\u20131463."},{"key":"e_1_3_1_27_2","first-page":"262","volume-title":"Proceedings of the 23rd Euromicro Conference on Digital System Design (DSD\u201920)","author":"Sateesan Arish","year":"2020","unstructured":"Arish Sateesan, Jo Vliegen, Joan Daemen, and Nele Mentens. 2020. Novel Bloom filter algorithms and architectures for ultra-high-speed network security applications. In Proceedings of the 23rd Euromicro Conference on Digital System Design (DSD\u201920). 262\u2013269."},{"key":"e_1_3_1_28_2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-031-22829-2_16","volume-title":"Proceedings of the 12th International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE\u201922)","author":"Sateesan Arish","year":"2022","unstructured":"Arish Sateesan, Jo Vliegen, and Nele Mentens. 2022. An analysis of the hardware-friendliness of AMQ data structures for network security. In Proceedings of the 12th International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE\u201922). Springer-Verlag, Berlin, 287\u2013313."},{"key":"e_1_3_1_29_2","first-page":"219","volume-title":"Proceedings of the 31st International Conference on Field-Programmable Logic and Applications (FPL\u201921)","author":"Sateesan Arish","year":"2021","unstructured":"Arish Sateesan, Jo Vliegen, Simon Scherrer, Hsu-Chun Hsiao, Adrian Perrig, and Nele Mentens. 2021. Speed records in network flow measurement on FPGA. In Proceedings of the 31st International Conference on Field-Programmable Logic and Applications (FPL\u201921). 219\u2013224."},{"key":"e_1_3_1_30_2","first-page":"162","volume-title":"Proceedings of the 42nd International Symposium on Reliable Distributed Systems (SRDS\u201923)","author":"Scherrer Simon","year":"2023","unstructured":"Simon Scherrer, Jo Vliegen, Arish Sateesan, Hsu-Chun Hsiao, Nele Mentens, and Adrian Perrig. 2023. ALBUS: A probabilistic monitoring algorithm to counter burst-flood attacks. In Proceedings of the 42nd International Symposium on Reliable Distributed Systems (SRDS\u201923). 162\u2013172."},{"key":"e_1_3_1_31_2","first-page":"265","volume-title":"Proceedings of the 40th International Symposium on Reliable Distributed Systems (SRDS\u201921)","author":"Scherrer Simon","year":"2021","unstructured":"Simon Scherrer, Che-Yu Wu, Yu-Hsi Chiang, Benjamin Rothenberger, Daniele E. Asoni, Arish Sateesan, Jo Vliegen, Nele Mentens, Hsu-Chun Hsiao, and Adrian Perrig. 2021. Low-rate overuse flow tracer (LOFT): An efficient and scalable algorithm for detecting overuse flows. In Proceedings of the 40th International Symposium on Reliable Distributed Systems (SRDS\u201921). 265\u2013276."},{"issue":"5","key":"e_1_3_1_32_2","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1109\/TNET.2007.896150","article-title":"Reversible sketches: Enabling monitoring and analysis over high-speed data streams","volume":"15","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. IEEE\/ACM Trans. Netw. 15, 5 (Oct. 2007), 1059\u20131072.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"e_1_3_1_33_2","article-title":"Traffic Monitoring using sFlow","year":"2003","unstructured":"sFlow. 2003. Traffic Monitoring using sFlow. Retrieved from http:\/\/www.sflow.org\/sFlowOverview.pdf. Accessed: 2023.","journal-title":"R"},{"key":"e_1_3_1_34_2","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/3050220.3063772","volume-title":"Proceedings of the Symposium on SDN Research (SOSR\u201917)","author":"Sivaraman Vibhaalakshmi","year":"2017","unstructured":"Vibhaalakshmi Sivaraman, Srinivas Narayana, Ori Rottenstreich, S. Muthukrishnan, and Jennifer Rexford. 2017. Heavy-hitter detection entirely in the data plane. In Proceedings of the Symposium on SDN Research (SOSR\u201917). Association for Computing Machinery, New York, NY, 164\u2013176."},{"issue":"5","key":"e_1_3_1_35_2","doi-asserted-by":"crossref","first-page":"2350","DOI":"10.1109\/TNET.2020.3011798","article-title":"A fast and compact invertible sketch for network-wide heavy flow detection","volume":"28","author":"Tang Lu","year":"2020","unstructured":"Lu Tang, Qun Huang, and Patrick P. C. Lee. 2020. A fast and compact invertible sketch for network-wide heavy flow detection. IEEE\/ACM Trans. Netw. 28, 5 (Oct. 2020), 2350\u20132363.","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"e_1_3_1_36_2","first-page":"1889","volume-title":"Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM\u201912)","author":"Tsidon Erez","year":"2012","unstructured":"Erez Tsidon, Iddo Hanniel, and Isaac Keslassy. 2012. Estimators also need shared values to grow together. In Proceedings of the Annual IEEE International Conference on Computer Communications (INFOCOM\u201912). 1889\u20131897."},{"key":"e_1_3_1_37_2","first-page":"1078","volume-title":"Proceedings of the IEEE 12th International Conference on Ubiquitous Intelligence and Computing and IEEE 12th International Conference on Autonomic and Trusted Computing and IEEE 15th International Conference on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom\u201915)","author":"Weerasinghe Jagath","year":"2015","unstructured":"Jagath Weerasinghe, Francois Abel, Christoph Hagleitner, and Andreas Herkersdorf. 2015. Enabling FPGAs in hyperscale data centers. In Proceedings of the IEEE 12th International Conference on Ubiquitous Intelligence and Computing and IEEE 12th International Conference on Autonomic and Trusted Computing and IEEE 15th International Conference on Scalable Computing and Communications and Its Associated Workshops (UIC-ATC-ScalCom\u201915). 1078\u20131086."},{"key":"e_1_3_1_38_2","first-page":"36","volume-title":"Proceedings of the International Conference on Field-Programmable Technology (FPT\u201916)","author":"Weerasinghe Jagath","year":"2016","unstructured":"Jagath Weerasinghe, Raphael Polig, Francois Abel, and Christoph Hagleitner. 2016. Network-attached FPGAs for data center applications. In Proceedings of the International Conference on Field-Programmable Technology (FPT\u201916). 36\u201343."},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/2663716.2663724","volume-title":"Proceedings of the Conference on Internet Measurement Conference (IMC\u201914)","author":"Wu Hao","year":"2014","unstructured":"Hao Wu, Hsu-Chun Hsiao, and Yih-Chun Hu. 2014. Efficient large flow detection over arbitrary windows: An algorithm exact outside an ambiguity region. In Proceedings of the Conference on Internet Measurement Conference (IMC\u201914). Association for Computing Machinery, New York, NY, 209\u2013222."},{"key":"e_1_3_1_40_2","article-title":"Content Addressable Memory (CAM)","author":"Xilinx AMD","year":"2023","unstructured":"AMD Xilinx. 2023. Content Addressable Memory (CAM). Retrieved from https:\/\/www.xilinx.com\/products\/intellectual-property\/ef-di-cam.html. Accessed: 2023.","journal-title":"R"},{"issue":"12","key":"e_1_3_1_41_2","doi-asserted-by":"crossref","first-page":"2650","DOI":"10.1109\/TPDS.2019.2923772","article-title":"Diamond sketch: Accurate per-flow measurement for big streaming data","volume":"30","author":"Yang Tong","year":"2019","unstructured":"Tong Yang, Siang Gao, Zhouyi Sun, Yufei Wang, Yulong Shen, and Xiaoming Li. 2019. Diamond sketch: Accurate per-flow measurement for big streaming data. IEEE Trans. Parallel Distrib. Syst. 30, 12 (2019), 2650\u20132662.","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"e_1_3_1_42_2","first-page":"561","volume-title":"Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM\u201918)","author":"Yang Tong","year":"2018","unstructured":"Tong Yang, Jie Jiang, Peng Liu, Qun Huang, Junzhi Gong, Yang Zhou, Rui Miao, Xiaoming Li, and Steve Uhlig. 2018. Elastic sketch: Adaptive and fast network-wide measurements. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication (SIGCOMM\u201918). Association for Computing Machinery, New York, NY, 561\u2013575."},{"key":"e_1_3_1_43_2","first-page":"103","volume-title":"Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE\u201917)","author":"Yang Tong","year":"2017","unstructured":"Tong Yang, Lingtong Liu, Yibo Yan, Muhammad Shahzad, Yulong Shen, Xiaoming Li, Bin Cui, and Gaogang Xie. 2017. SF-sketch: A fast, accurate, and memory efficient data structure to store frequencies of data items. In Proceedings of the IEEE 33rd International Conference on Data Engineering (ICDE\u201917). 103\u2013106."},{"key":"e_1_3_1_44_2","first-page":"1","volume-title":"Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS\u201918)","author":"Zhou Yang","year":"2018","unstructured":"Yang Zhou, Hao Jin, Peng Liu, Haowei Zhang, Tong Yang, and Xiaoming Li. 2018. Accurate per-flow measurement with bloom sketch. In Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS\u201918). 1\u20132."},{"key":"e_1_3_1_45_2","first-page":"1","volume-title":"Proceedings of the IEEE Global Communications Conference (GLOBECOM\u201917)","author":"Zhou Yang","year":"2017","unstructured":"Yang Zhou, Peng Liu, Hao Jin, Tong Yang, Shoujiang Dang, and Xiaoming Li. 2017. One memory access sketch: A more accurate and faster sketch for per-flow measurement. In Proceedings of the IEEE Global Communications Conference (GLOBECOM\u201917). IEEE Press, 1\u20136."},{"issue":"23","key":"e_1_3_1_46_2","doi-asserted-by":"crossref","first-page":"e5891","DOI":"10.1002\/cpe.5891","article-title":"SA sketch: A self-adaption sketch framework for high-speed network","volume":"32","author":"Zhu Haiting","year":"2020","unstructured":"Haiting Zhu, Yuan Zhang, Lu Zhang, Gaofeng He, Linfeng Liu, and Ning Liu. 2020. SA sketch: A self-adaption sketch framework for high-speed network. Concurr. Comput.: Pract. Exper. 32, 23 (2020), e5891.","journal-title":"Concurr. Comput.: Pract. Exper."}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687477","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3687477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:59Z","timestamp":1750291559000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3687477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,16]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3687477"],"URL":"https:\/\/doi.org\/10.1145\/3687477","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"value":"2471-2566","type":"print"},{"value":"2471-2574","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,16]]},"assertion":[{"value":"2023-10-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}