{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:27Z","timestamp":1750220727771,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T00:00:00Z","timestamp":1597017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Innovation Center, Ericsson Telecomunicacoes S.A., Brazil","award":["UNI.66"],"award-info":[{"award-number":["UNI.66"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,10]]},"DOI":"10.1145\/3405837.3411388","type":"proceedings-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T21:50:56Z","timestamp":1631656256000},"page":"49-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Revisiting heavy-hitters"],"prefix":"10.1145","author":[{"given":"Suneet Kumar","family":"Singh","sequence":"first","affiliation":[{"name":"University of Campinas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Rothenberg","sequence":"additional","affiliation":[{"name":"University of Campinas"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo Caggiani","family":"Luizelli","sequence":"additional","affiliation":[{"name":"Federal University of Pampa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianni","family":"Antichi","sequence":"additional","affiliation":[{"name":"Queen Mary University of London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gergely","family":"Pongracz","sequence":"additional","affiliation":[{"name":"Ericsson Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SIGCOMM","author":"Vorsanger V.","year":"2016","unstructured":"G. Vorsanger V. Sekar Z. Liu, A. Manousis and V. Braverman. One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon. SIGCOMM, 2016."},{"key":"e_1_3_2_1_2_1","volume-title":"SOSR","author":"Rottenstreich S.","year":"2017","unstructured":"O. Rottenstreich S. Muthukrishnan V. Sivaraman, S. Narayana and J. Rexford. Heavy-Hitter Detection Entirely in the Data Plane. SOSR, 2017."},{"key":"e_1_3_2_1_3_1","volume-title":"SOSR","author":"Wang A.","year":"2020","unstructured":"H. Wang A. Moore J. Korenek J. Kucera, D. A. Popescu and G. Antichi. Enabling Event-Triggered Data Plane Monitoring. SOSR, 2020."},{"key":"e_1_3_2_1_4_1","volume-title":"SIGCOMM","author":"Kim J.","year":"2017","unstructured":"C. Kim J. Lee R. Miao, H. Zeng and M. Yu. SilkRoad: Making Stateful Layer-4 Load Balancing Fast and Cheap Using Switching ASICs. SIGCOMM, 2017."},{"key":"e_1_3_2_1_5_1","volume-title":"SIGCOMM Poster","author":"Moore G.","year":"2018","unstructured":"A. W. Moore G. Bianchi S. Galea, G. Antichi and R. Bifulco. Revealing Hidden Hierarchical Heavy Hitters in network traffic. SIGCOMM Poster, 2018."},{"key":"e_1_3_2_1_6_1","volume-title":"The CAIDA UCSD Anonymized Internet Traces","author":"CAIDA.","year":"2016","unstructured":"CAIDA. The CAIDA UCSD Anonymized Internet Traces, 2016."},{"key":"e_1_3_2_1_7_1","volume-title":"International Conference on Database Theory. Springer","author":"Agrawal A.","year":"2005","unstructured":"D. Agrawal A. Metwally and A. ElAbbadi. Efficient computation of frequent and top-k elements in data streams. International Conference on Database Theory. Springer, 2005."},{"key":"e_1_3_2_1_8_1","volume-title":"HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows. USENIX Annual Technical Conference","author":"Zhang H.","year":"2018","unstructured":"H. Zhang H. Li S. Uhlig. S. Chen L. Uden J. Gong, T. Yang and X. Li. HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows. USENIX Annual Technical Conference, 2018."},{"key":"e_1_3_2_1_9_1","volume-title":"SIGCOMM Workshop on Internet Measurement","author":"Bhattacharyya P.","year":"2002","unstructured":"S. Bhattacharyya P. Thiran K. Salamatian K. Papagiannaki, N. Taft, L. Uden, and C. Diot. A Pragmatic Definition of Elephants in Internet Backbone Traffic. SIGCOMM Workshop on Internet Measurement, 2002."}],"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","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Virtual event","acronym":"SIGCOMM '20"},"container-title":["Proceedings of the SIGCOMM '20 Poster and Demo Sessions"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3405837.3411388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3405837.3411388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:18Z","timestamp":1750199898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3405837.3411388"}},"subtitle":["don't count packets, compute flow inter-packet metrics in the data plane"],"short-title":[],"issued":{"date-parts":[[2020,8,10]]},"references-count":9,"alternative-id":["10.1145\/3405837.3411388","10.1145\/3405837"],"URL":"https:\/\/doi.org\/10.1145\/3405837.3411388","relation":{},"subject":[],"published":{"date-parts":[[2020,8,10]]},"assertion":[{"value":"2021-09-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}