{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:56:48Z","timestamp":1768517808108,"version":"3.49.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,14]]},"DOI":"10.1109\/icpads67057.2025.11322933","type":"proceedings-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:36:54Z","timestamp":1768423014000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Aegis Sketch: High-Throughput and Accurate Top-$k$ Elephant Flows Detection in Large-Scale Parallel Network Traffic Processing"],"prefix":"10.1109","author":[{"given":"Siyuan","family":"Wang","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Guangdong,China"}]},{"given":"Lu","family":"Cao","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Guangdong,China"}]},{"given":"Desheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Guangdong,China"}]},{"given":"Weizhe","family":"Zhang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen),Guangdong,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3588933"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219975"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3040596"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.05.037"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3040596"},{"key":"ref6","article-title":"Software defined traffic measurement with opensketch","author":"Yu","year":"2013","journal-title":"in USENIX NSDI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2019.107404"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00078"},{"issue":"3","key":"ref11","first-page":"391","article-title":"Large flow identification based on counting bloom filter and space saving","volume":"32","author":"Xiaohuan","year":"2015","journal-title":"Journal of University of Chinese Academy of Sciences"},{"key":"ref12","first-page":"178","article-title":"Elastic sketch: Adaptive and fast networkwide measurements","author":"Wang","year":"2018","journal-title":"in ACM SIGCOMM"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3278028"},{"key":"ref14","first-page":"1243","article-title":"Augmented sketches for finding top-k items in data streams","author":"Tang","year":"2016","journal-title":"in ACM SIGMOD"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3042433"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref17","volume-title":"The source code for aegissketch."},{"key":"ref18","first-page":"2501","article-title":"Sketching linear-probed hash tables","author":"Deng","year":"2007","journal-title":"IEEE INFOCOM"},{"key":"ref19","first-page":"1","article-title":"Sketching-based heavy hitter detection in data streams","author":"Garg","year":"2010","journal-title":"in IEEE INFOCOM"},{"issue":"3","key":"ref20","first-page":"1","article-title":"A survey on heavy hitter detection in data stream model","volume":"47","author":"Esteban","year":"2015","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"ref21","first-page":"111","article-title":"New data stream algorithms for frequent items and heavy hitters","volume-title":"ACM Symposium on Theory of Computing (STOC)","author":"Kirsch","year":"2006"},{"key":"ref22","first-page":"390","article-title":"Efficient computation of frequent and top-k elements in data streams","volume-title":"International Conference on Database Theory (ICDT)","author":"Metwally","year":"2005"},{"issue":"4","key":"ref23","first-page":"1671","article-title":"Heavykeeper: An accurate and highperformance sketch for network-wide top-k","volume":"27","author":"Ma","year":"2019","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"4","key":"ref24","first-page":"1554","article-title":"Mv-sketch: A memory-efficient and highperformance sketch for network-wide multi-dimensional traffic measurement","volume":"28","author":"Li","year":"2020","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"2","key":"ref25","first-page":"568","article-title":"Cuckoo counter: A highly efficient sketch for top-k heavy hitters","volume":"31","author":"Feng","year":"2023","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025112"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"2","key":"ref29","first-page":"1117","article-title":"Onesketch: A generic and accurate sketch for data streams","volume":"35","author":"Yin","year":"2023","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"ref30","volume-title":"Hash website","author":"Jenkins","year":"2024"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref32","article-title":"The caida traces","volume-title":"Cooperative Association for Internet Data Analysis","year":"2016"},{"key":"ref33","first-page":"2024","article-title":"MAWI Working Group Traffic Archive","author":"Working Group","year":"2024","journal-title":"accessed"}],"event":{"name":"2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)","location":"Hefei, China","start":{"date-parts":[[2025,12,14]]},"end":{"date-parts":[[2025,12,18]]}},"container-title":["2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11322805\/11322871\/11322933.pdf?arnumber=11322933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T07:11:46Z","timestamp":1768461106000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11322933\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/icpads67057.2025.11322933","relation":{},"subject":[],"published":{"date-parts":[[2025,12,14]]}}}