{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:55:33Z","timestamp":1767772533574,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:00:00Z","timestamp":1633910400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,10,11]]},"DOI":"10.1145\/3482898.3483356","type":"proceedings-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T11:07:28Z","timestamp":1636369648000},"page":"101-107","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Clustreams"],"prefix":"10.1145","author":[{"given":"Roy","family":"Friedman","sequence":"first","affiliation":[{"name":"Computer Science Department, Technion"}]},{"given":"Or","family":"Goaz","sequence":"additional","affiliation":[{"name":"Computer Science Department, Technion"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"C. Science and E. Engineering, Technion"}]}],"member":"320","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"632","article-title":"F. Gray. Pulse code communication","volume":"2","year":"1953","unstructured":"1953 . F. Gray. Pulse code communication . US Patent 2 , 632 ,058. 1953. F. Gray. Pulse code communication. US Patent 2,632,058.","journal-title":"US Patent"},{"key":"e_1_3_2_1_2_1","unstructured":"2021. Clustreams generation and analysis code. https:\/\/github.com\/orgoaz\/Clustreams.  2021. Clustreams generation and analysis code. https:\/\/github.com\/orgoaz\/Clustreams."},{"key":"e_1_3_2_1_3_1","unstructured":"Barefoot. 2017. Barefoot Tofino. https:\/\/www.barefootnetworks.com\/technology\/#tofino.  Barefoot. 2017. Barefoot Tofino. https:\/\/www.barefootnetworks.com\/technology\/#tofino."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9236(99)00055-X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_3_2_1_6_1","volume-title":"Ultra-Fast Similarity Search Using Ternary Content Addressable Memory. In International Workshop on Data Management.","author":"Bremler-Barr Anat","year":"2015","unstructured":"Anat Bremler-Barr , Yotam Harchol , David Hay , and Yacov Hel-Or . 2015 . Ultra-Fast Similarity Search Using Ternary Content Addressable Memory. In International Workshop on Data Management. Anat Bremler-Barr, Yotam Harchol, David Hay, and Yacov Hel-Or. 2015. Ultra-Fast Similarity Search Using Ternary Content Addressable Memory. In International Workshop on Data Management."},{"key":"e_1_3_2_1_7_1","unstructured":"Coralie Busse-Grawitz Roland Meier Alexander Dietm\u00fcller Tobias B\u00fchler and Laurent Vanbever. 2019. pForest: In-Network Inference with Random Forests. CoRR(2019).  Coralie Busse-Grawitz Roland Meier Alexander Dietm\u00fcller Tobias B\u00fchler and Laurent Vanbever. 2019. pForest: In-Network Inference with Random Forests. CoRR(2019)."},{"issue":"2","key":"e_1_3_2_1_8_1","first-page":"0","article-title":"The P4 Language Consortium. The P4 Language Specification","volume":"1","author":"The P4 Language Consortium","year":"2020","unstructured":"The P4 Language Consortium . 2020 . The P4 Language Consortium. The P4 Language Specification , Version 1 . 2 . 0 - Release Candidate, October 2020. https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.2.0.html\/.. The P4 Language Consortium. 2020. The P4 Language Consortium. The P4 Language Specification, Version 1.2.0 - Release Candidate, October 2020. https:\/\/p4.org\/p4-spec\/docs\/P4-16-v1.2.0.html\/..","journal-title":"Version"},{"key":"e_1_3_2_1_9_1","volume-title":"Why (and How) Networks Should Run Themselves. In ACM Applied Networking Research Workshop (ANRW).","author":"Feamster Nick","year":"2018","unstructured":"Nick Feamster and Jennifer Rexford . 2018 . Why (and How) Networks Should Run Themselves. In ACM Applied Networking Research Workshop (ANRW). Nick Feamster and Jennifer Rexford. 2018. Why (and How) Networks Should Run Themselves. In ACM Applied Networking Research Workshop (ANRW)."},{"key":"e_1_3_2_1_10_1","first-page":"100","article-title":"Algorithm AS 136: A K-Means Clustering Algorithm","volume":"1","author":"Hartigan J. A.","year":"1979","unstructured":"J. A. Hartigan and M. A. Wong . 1979 . Algorithm AS 136: A K-Means Clustering Algorithm . Journal of the Royal Statistical Society. Series C (Applied Statistics)28 , 1 (1979), 100 -- 108 . J. A. Hartigan and M. A. Wong. 1979. Algorithm AS 136: A K-Means Clustering Algorithm. Journal of the Royal Statistical Society. Series C (Applied Statistics)28, 1 (1979), 100--108.","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)28"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132764"},{"key":"e_1_3_2_1_12_1","volume-title":"Crime Analysis Using K-Means Clustering. In International Conference on Computational Intelligence and Networks (CINE).","author":"Joshi Anant","year":"2017","unstructured":"Anant Joshi , A. Sai Sabitha , and Tanupriya Choudhury . 2017 . Crime Analysis Using K-Means Clustering. In International Conference on Computational Intelligence and Networks (CINE). Anant Joshi, A. Sai Sabitha, and Tanupriya Choudhury. 2017. Crime Analysis Using K-Means Clustering. In International Conference on Computational Intelligence and Networks (CINE)."},{"key":"e_1_3_2_1_13_1","volume-title":"Empowering Self-Driving Networks. In ACM Workshop on Self-Driving Networks, SelfDN@SIGCOMM.","author":"Kalmbach Patrick","year":"2018","unstructured":"Patrick Kalmbach , Johannes Zerwas , P\u00e9ter Babarczi , Andreas Blenk , Wolfgang Kellerer , and Stefan Schmid . 2018 . Empowering Self-Driving Networks. In ACM Workshop on Self-Driving Networks, SelfDN@SIGCOMM. Patrick Kalmbach, Johannes Zerwas, P\u00e9ter Babarczi, Andreas Blenk, Wolfgang Kellerer, and Stefan Schmid. 2018. Empowering Self-Driving Networks. In ACM Workshop on Self-Driving Networks, SelfDN@SIGCOMM."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223675"},{"key":"e_1_3_2_1_16_1","unstructured":"T. Soni Madhulatha. 2012. An Overview on Clustering Methods. CoRR(2012).  T. Soni Madhulatha. 2012. An Overview on Clustering Methods. CoRR(2012)."},{"key":"e_1_3_2_1_17_1","volume-title":"Flow Clustering Using Machine Learning Techniques. In International Workshop on Passive and Active Network Measurement (PAM).","author":"McGregor Anthony","year":"2004","unstructured":"Anthony McGregor , Mark A. Hall , Perry Lorier , and James Brunskill . 2004 . Flow Clustering Using Machine Learning Techniques. In International Workshop on Passive and Active Network Measurement (PAM). Anthony McGregor, Mark A. Hall, Perry Lorier, and James Brunskill. 2004. Flow Clustering Using Machine Learning Techniques. In International Workshop on Passive and Active Network Measurement (PAM)."},{"key":"e_1_3_2_1_18_1","volume-title":"PISA: Protocol Independent Switch Architecture. In P4 Workshop.","author":"McKeown N.","year":"2015","unstructured":"N. McKeown . 2015 . PISA: Protocol Independent Switch Architecture. In P4 Workshop. N. McKeown. 2015. PISA: Protocol Independent Switch Architecture. In P4 Workshop."},{"volume-title":"ACM International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS).","author":"Andrew","key":"e_1_3_2_1_19_1","unstructured":"Andrew W. Moore and Denis Zuev. 2005. Internet traffic classification using bayesian analysis techniques . In ACM International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS). Andrew W. Moore and Denis Zuev. 2005. Internet traffic classification using bayesian analysis techniques. In ACM International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS)."},{"key":"e_1_3_2_1_20_1","volume-title":"Armitage","author":"Nguyen Thuy T. T.","year":"2008","unstructured":"Thuy T. T. Nguyen and Grenville J . Armitage . 2008 . A survey of techniques for internet traffic classification using machine learning. IEEE Commun. Surv. Tutorials 10, 1-4(2008), 56--76. Thuy T. T. Nguyen and Grenville J. Armitage. 2008. A survey of techniques for internet traffic classification using machine learning. IEEE Commun. Surv. Tutorials10, 1-4(2008), 56--76."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/5040475"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"P. Rai and S. Singh. 2010. A survey of clustering techniques. International Journal of Computer Applications7 0975-8887 (2010) 1--5.  P. Rai and S. Singh. 2010. A survey of clustering techniques. International Journal of Computer Applications7 0975-8887 (2010) 1--5.","DOI":"10.5120\/1326-1808"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"e_1_3_2_1_24_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 SIGCOMM.  Anirudh Sivaraman Changhoon Kim Ramkumar Krishnamoorthy Advait Dixit and Mihai Budiu. 2015. DC.p4: Programming the forwarding plane of a datacenter switch. In ACM SIGCOMM.","DOI":"10.1145\/2774993.2775007"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Vibhaalakshmi Sivaraman Srinivas Narayana Ori Rottenstreich S. Muthukrishnan and Jennifer Rexford. 2017. Heavy-Hitter Detection Entirely in the Data Plane. In ACM SOSR.  Vibhaalakshmi Sivaraman Srinivas Narayana Ori Rottenstreich S. Muthukrishnan and Jennifer Rexford. 2017. Heavy-Hitter Detection Entirely in the Data Plane. In ACM SOSR.","DOI":"10.1145\/3050220.3063772"},{"key":"e_1_3_2_1_26_1","first-page":"185","article-title":"A Quadtree-Based Dynamic Attribute Indexing","volume":"41","author":"Tayeb Jamel","year":"1998","unstructured":"Jamel Tayeb , \u00d6zg\u00fcr Ulusoy , and Ouri Wolfson . 1998 . A Quadtree-Based Dynamic Attribute Indexing Method. Comput. J. 41 , 3 (1998), 185 -- 200 . Jamel Tayeb, \u00d6zg\u00fcr Ulusoy, and Ouri Wolfson. 1998. A Quadtree-Based Dynamic Attribute Indexing Method. Comput. J.41, 3 (1998), 185--200.","journal-title":"Method. Comput. J."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2010.11.002"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365609.3365864"}],"event":{"name":"SOSR '21: The ACM SIGCOMM Symposium on SDN Research","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual Event USA","acronym":"SOSR '21"},"container-title":["Proceedings of the ACM SIGCOMM Symposium on SDN Research (SOSR)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3482898.3483356","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3482898.3483356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:45Z","timestamp":1750193325000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3482898.3483356"}},"subtitle":["Data Plane Clustering"],"short-title":[],"issued":{"date-parts":[[2021,10,11]]},"references-count":28,"alternative-id":["10.1145\/3482898.3483356","10.1145\/3482898"],"URL":"https:\/\/doi.org\/10.1145\/3482898.3483356","relation":{},"subject":[],"published":{"date-parts":[[2021,10,11]]},"assertion":[{"value":"2021-11-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}