{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:40:26Z","timestamp":1782834026886,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T00:00:00Z","timestamp":1606089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education","award":["Academic Research Fund Tier 2 (Grant Number: MOE2019-T2-2-134)"],"award-info":[{"award-number":["Academic Research Fund Tier 2 (Grant Number: MOE2019-T2-2-134)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,23]]},"DOI":"10.1145\/3386367.3432729","type":"proceedings-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:53:05Z","timestamp":1606258385000},"page":"78-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":61,"title":["FCM-sketch"],"prefix":"10.1145","author":[{"given":"Cha Hwan","family":"Song","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pravein Govindan","family":"Kannan","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryan Kian Hsiang","family":"Low","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mun Choon","family":"Chan","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,24]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Barefoot tofino 2. https:\/\/www.barefootnetworks.com\/press-releases\/barefoot-networks-unveils-tofino-2-the-next-generation-of-the-worlds-first-fully-p4-programmable-network-switch-asics\/.  Barefoot tofino 2. https:\/\/www.barefootnetworks.com\/press-releases\/barefoot-networks-unveils-tofino-2-the-next-generation-of-the-worlds-first-fully-p4-programmable-network-switch-asics\/."},{"key":"e_1_3_2_2_2_1","unstructured":"The caida ucsd anonymized internet traces - 20190117. http:\/\/www.caida.org\/data\/passive\/passive_dataset.xml.  The caida ucsd anonymized internet traces - 20190117. http:\/\/www.caida.org\/data\/passive\/passive_dataset.xml."},{"key":"e_1_3_2_2_3_1","unstructured":"Netflow. https:\/\/en.wikipedia.org\/wiki\/NetFlow.  Netflow. https:\/\/en.wikipedia.org\/wiki\/NetFlow."},{"key":"e_1_3_2_2_4_1","unstructured":"P4 Language Consortium. 2018. Baseline switch.p4. https:\/\/github.com\/p4lang\/switch\/blob\/\\master\/p4src\/switch.p4.  P4 Language Consortium. 2018. Baseline switch.p4. https:\/\/github.com\/p4lang\/switch\/blob\/\\master\/p4src\/switch.p4."},{"key":"e_1_3_2_2_5_1","unstructured":"Portable Switch Architecture. https:\/\/p4.org\/p4-spec\/docs\/PSA-v1.0.0.pdf.  Portable Switch Architecture. https:\/\/p4.org\/p4-spec\/docs\/PSA-v1.0.0.pdf."},{"key":"e_1_3_2_2_6_1","unstructured":"Sflow. https:\/\/en.wikipedia.org\/wiki\/SFlow.  Sflow. https:\/\/en.wikipedia.org\/wiki\/SFlow."},{"key":"e_1_3_2_2_7_1","unstructured":"Wedge 100bf-32x. https:\/\/www.edge-core.com\/productsInfo.php?\\cls=1&cls2=180&cls3=181&id=335.  Wedge 100bf-32x. https:\/\/www.edge-core.com\/productsInfo.php?\\cls=1&cls2=180&cls3=181&id=335."},{"key":"e_1_3_2_2_8_1","unstructured":"The world's fastest and most programmable networks. https:\/\/www.barefootnetworks.com\/resources\/worlds-fastest-most-programmable-networks\/.  The world's fastest and most programmable networks. https:\/\/www.barefootnetworks.com\/resources\/worlds-fastest-most-programmable-networks\/."},{"key":"e_1_3_2_2_9_1","volume-title":"https:\/\/github.com\/zhouyangpkuer\/Pyramid_Sketch_Framework","year":"2017","unstructured":"Pyramidsketch source code. https:\/\/github.com\/zhouyangpkuer\/Pyramid_Sketch_Framework , 2017 . Pyramidsketch source code. https:\/\/github.com\/zhouyangpkuer\/Pyramid_Sketch_Framework, 2017."},{"key":"e_1_3_2_2_10_1","volume-title":"https:\/\/github.com\/BlockLiu\/ElasticSketchCode","year":"2018","unstructured":"Elasticsketch source code. https:\/\/github.com\/BlockLiu\/ElasticSketchCode , 2018 . Elasticsketch source code. https:\/\/github.com\/BlockLiu\/ElasticSketchCode, 2018."},{"key":"e_1_3_2_2_11_1","volume-title":"https:\/\/github.com\/fcm-project","year":"2020","unstructured":"Fcm-sketch source code. https:\/\/github.com\/fcm-project , 2020 . Fcm-sketch source code. https:\/\/github.com\/fcm-project, 2020."},{"key":"e_1_3_2_2_12_1","author":"Basat R. B.","year":"2020","unstructured":"R. B. Basat , X. Chen , G. Einziger , and O. Rottenstreich . Designing heavy-hitter detection algorithms for programmable switches. IEEE\/ACM Transactions on Networking , 2020 . R. B. Basat, X. Chen, G. Einziger, and O. Rottenstreich. Designing heavy-hitter detection algorithms for programmable switches. IEEE\/ACM Transactions on Networking, 2020.","journal-title":"Designing heavy-hitter detection algorithms for programmable switches. IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1391"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_2_15_1","volume-title":"Entropy","author":"Berezi\u0144ski P.","year":"2015","unstructured":"P. Berezi\u0144ski , B. Jasiul , and M. Szpyrka . An entropy-based network anomaly detection method . Entropy , 2015 . P. Berezi\u0144ski, B. Jasiul, and M. Szpyrka. An entropy-based network anomaly detection method. Entropy, 2015."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_5"},{"key":"e_1_3_2_2_18_1","volume-title":"Xpliant ethernet switch product family","year":"2018","unstructured":"Cavium. Xpliant ethernet switch product family , 2018 . Cavium. Xpliant ethernet switch product family, 2018."},{"key":"e_1_3_2_2_19_1","author":"Chen M.","year":"2017","unstructured":"M. Chen , S. Chen , and Z. Cai . Counter tree: A scalable counter architecture for per-flow traffic measurement. IEEE\/ACM Transactions on Networking (TON) , 2017 . M. Chen, S. Chen, and Z. Cai. Counter tree: A scalable counter architecture for per-flow traffic measurement. IEEE\/ACM Transactions on Networking (TON), 2017.","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229584.3229586"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365408"},{"key":"e_1_3_2_2_22_1","author":"Cormode G.","year":"2005","unstructured":"G. Cormode and S. Muthukrishnan . An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms , 2005 . G. Cormode and S. Muthukrishnan. An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms, 2005.","journal-title":"Journal of Algorithms"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.04.007"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2019.8806649"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274808.3274816"},{"key":"e_1_3_2_2_26_1","author":"Estan C.","year":"2003","unstructured":"C. Estan and G. Varghese . New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS) , 2003 . C. Estan and G. Varghese. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems (TOCS), 2003.","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_2_28_1","volume-title":"EMNLP","author":"Goyal A.","year":"2011","unstructured":"A. Goyal and H. Daum\u00e9 III. Approximate scalable bounded space sketch for large data nlp . In EMNLP , 2011 . A. Goyal and H. Daum\u00e9 III. Approximate scalable bounded space sketch for large data nlp. In EMNLP, 2011."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3185467.3185476"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384609.1384614"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230559"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365433"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132764"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890968"},{"key":"e_1_3_2_2_36_1","author":"Katzela I.","year":"1995","unstructured":"I. Katzela and M. Schwartz . Schemes for fault identification in communication networks. IEEE\/ACM Transactions on Networking , 1995 . I. Katzela and M. Schwartz. Schemes for fault identification in communication networks. IEEE\/ACM Transactions on Networking, 1995.","journal-title":"Schemes for fault identification in communication networks. IEEE\/ACM Transactions on Networking"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405855"},{"key":"e_1_3_2_2_38_1","author":"Kumar A.","year":"2004","unstructured":"A. Kumar , M. Sung , J. J. Xu , and J. Wang . Data streaming algorithms for efficient and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation Review , 2004 . A. Kumar, M. Sung, J. J. Xu, and J. Wang. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In ACM SIGMETRICS Performance Evaluation Review, 2004.","journal-title":"In ACM SIGMETRICS Performance Evaluation Review"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ANCS.2019.8901888"},{"key":"e_1_3_2_2_40_1","author":"Lall A.","year":"2006","unstructured":"A. Lall , V. Sekar , M. Ogihara , J. Xu , and H. Zhang . Data streaming algorithms for estimating entropy of network traffic. ACM SIGMETRICS Performance Evaluation Review , 2006 . A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang. Data streaming algorithms for estimating entropy of network traffic. ACM SIGMETRICS Performance Evaluation Review, 2006.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"e_1_3_2_2_41_1","volume-title":"IFIP\/IEEE Symposium on Integrated Network and Service Management (IM)","author":"Lapolli C.","year":"2019","unstructured":"\u00c2. C. Lapolli , J. A. Marques , and L. P. Gaspary . Offloading real-time ddos attack detection to programmable data planes . In IFIP\/IEEE Symposium on Integrated Network and Service Management (IM) , 2019 . \u00c2. C. Lapolli, J. A. Marques, and L. P. Gaspary. Offloading real-time ddos attack detection to programmable data planes. In IFIP\/IEEE Symposium on Integrated Network and Service Management (IM), 2019."},{"key":"e_1_3_2_2_42_1","volume-title":"USENIX FAST","author":"Liu Z.","year":"2019","unstructured":"Z. Liu , Z. Bai , Z. Liu , X. Li , C. Kim , V. Braverman , X. Jin , and I. Stoica . Distcache: Provable load balancing for large-scale storage systems with distributed caching . In USENIX FAST , 2019 . Z. Liu, Z. Bai, Z. Liu, X. Li, C. Kim, V. Braverman, X. Jin, and I. Stoica. Distcache: Provable load balancing for large-scale storage systems with distributed caching. In USENIX FAST, 2019."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342076"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_3_2_2_45_1","author":"Lu Y.","year":"2008","unstructured":"Y. Lu , A. Montanari , B. Prabhakar , S. Dharmapurikar , and A. Kabbani . Counter braids: a novel counter architecture for per-flow measurement. ACM SIGMETRICS Performance Evaluation Review , 2008 . Y. Lu, A. Montanari, B. Prabhakar, S. Dharmapurikar, and A. Kabbani. Counter braids: a novel counter architecture for per-flow measurement. ACM SIGMETRICS Performance Evaluation Review, 2008.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"e_1_3_2_2_46_1","author":"McCauley J.","year":"2019","unstructured":"J. McCauley , A. Panda , A. Krishnamurthy , and S. Shenker . Thoughts on load distribution and the role of programmable switches. ACM SIGCOMM Computer Communication Review , 2019 . J. McCauley, A. Panda, A. Krishnamurthy, and S. Shenker. Thoughts on load distribution and the role of programmable switches. ACM SIGCOMM Computer Communication Review, 2019.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098824"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336672"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/1603899.1603924"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_3_2_2_52_1","volume-title":"USENIX NSDI","author":"Sharma N. K.","year":"2017","unstructured":"N. K. Sharma , A. Kaufmann , T. Anderson , A. Krishnamurthy , J. Nelson , and S. Peter . Evaluating the power of flexible packet processing for network resource allocation . In USENIX NSDI , 2017 . N. K. Sharma, A. Kaufmann, T. Anderson, A. Krishnamurthy, J. Nelson, and S. Peter. Evaluating the power of flexible packet processing for network resource allocation. In USENIX NSDI, 2017."},{"key":"e_1_3_2_2_53_1","volume-title":"USENIX NSDI","author":"Sharma N. K.","year":"2018","unstructured":"N. K. Sharma , M. Liu , K. Atreya , and A. Krishnamurthy . Approximating fair queueing on reconfigurable switches . In USENIX NSDI , 2018 . N. K. Sharma, M. Liu, K. Atreya, and A. Krishnamurthy. Approximating fair queueing on reconfigurable switches. In USENIX NSDI, 2018."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3063772"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155541"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3229574.3229581"},{"key":"e_1_3_2_2_57_1","volume-title":"USENIX NSDI","author":"\u00d0uki\u0107 V.","year":"2019","unstructured":"V. \u00d0uki\u0107 , S. A. Jyothi , B. Karla\u0161 , M. Owaida , C. Zhang , and A. Singla . Is advance knowledge of flow sizes a plausible assumption ? In USENIX NSDI , 2019 . V. \u00d0uki\u0107, S. A. Jyothi, B. Karla\u0161, M. Owaida, C. Zhang, and A. Singla. Is advance knowledge of flow sizes a plausible assumption? In USENIX NSDI, 2019."},{"key":"e_1_3_2_2_58_1","author":"Whang K.-Y.","year":"1990","unstructured":"K.-Y. Whang , B. T. Vander-Zanden , and H. M. Taylor . A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS) , 1990 . K.-Y. Whang, B. T. Vander-Zanden, and H. M. Taylor. A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS), 1990.","journal-title":"A linear-time probabilistic counting algorithm for database applications. ACM Transactions on Database Systems (TODS)"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137652"},{"key":"e_1_3_2_2_61_1","volume-title":"USENIX NSDI","author":"Yu M.","year":"2013","unstructured":"M. Yu , L. Jose , and R. Miao . Software defined traffic measurement with opensketch . In USENIX NSDI , 2013 . M. Yu, L. Jose, and R. Miao. Software defined traffic measurement with opensketch. In USENIX NSDI, 2013."},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787484"}],"event":{"name":"CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies","location":"Barcelona Spain","acronym":"CoNEXT '20","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 16th International Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386367.3432729","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3386367.3432729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:32:04Z","timestamp":1750195924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386367.3432729"}},"subtitle":["generic network measurements with data plane support"],"short-title":[],"issued":{"date-parts":[[2020,11,23]]},"references-count":63,"alternative-id":["10.1145\/3386367.3432729","10.1145\/3386367"],"URL":"https:\/\/doi.org\/10.1145\/3386367.3432729","relation":{},"subject":[],"published":{"date-parts":[[2020,11,23]]},"assertion":[{"value":"2020-11-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}