{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:28:54Z","timestamp":1781368134916,"version":"3.54.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Primary Research & Development Plan of China","award":["2018YFB1004403"],"award-info":[{"award-number":["2018YFB1004403"]}]},{"name":"Primary Research & Development Plan of China","award":["2016YFB1000304"],"award-info":[{"award-number":["2016YFB1000304"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672061"],"award-info":[{"award-number":["61672061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Peacock Innovation Program","award":["KQJSCX20180323174744219"],"award-info":[{"award-number":["KQJSCX20180323174744219"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tnet.2019.2933868","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T19:38:50Z","timestamp":1566502730000},"page":"1845-1858","source":"Crossref","is-referenced-by-count":161,"title":["HeavyKeeper: An Accurate Algorithm for Finding Top-$k$  Elephant Flows"],"prefix":"10.1109","volume":"27","author":[{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haowei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0003-2484-4390","authenticated-orcid":false,"given":"Jinyang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-8939-9120","authenticated-orcid":false,"given":"Junzhi","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0001-6251-6836","authenticated-orcid":false,"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_33"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/HSPR.2008.4734429"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"ref31","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"Proc ICDT"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524364"},{"key":"ref37","first-page":"311","article-title":"FlowRadar: A better netflow for data centers","author":"li","year":"2016","journal-title":"Proc NSDI"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2797096"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0074-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0066-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2804018"},{"key":"ref27","first-page":"335","article-title":"Unraveling the complexity of network management","author":"maltz","year":"2009","journal-title":"Proc USENIX\/ACM Symp Netw Syst Design Implement"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-016-0022-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934899"},{"key":"ref1","first-page":"909","article-title":"HeavyKeeper: An accurate algorithm for finding top-k elephant flows","author":"gong","year":"2018","journal-title":"Proc USENIX ATC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-010-0053-5"},{"key":"ref22","article-title":"Sketch techniques for approximate query processing","author":"cormode","year":"2011","journal-title":"Foundations and Trends in Databases"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/510726.510749"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592600"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1002\/spe.576"},{"key":"ref51","year":"2018","journal-title":"The Open Source Library That Implements Lossy Counting CM Sketch Space Saving and Others"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298345"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025112"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2272604"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486415"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0382-5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956804.956807"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.44"},{"key":"ref18","author":"salton","year":"1986","journal-title":"Introduction to Modern Information Retrieval"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367935"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028813"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347554"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230559"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2611482"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737499"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"ref49","first-page":"151","article-title":"Applications and explanations of zipf’s law","author":"powers","year":"1998","journal-title":"Proc Joint Conf New Methods Lang Process Comput Natural Lang Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.57"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6"},{"key":"ref45","year":"2018","journal-title":"The Source Codes of Heavykeeper and Other Related Algorithms"},{"key":"ref48","year":"2016","journal-title":"CAIDA Anonymized Internet Trace"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9550-y"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219978"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2833312.2833449"},{"key":"ref43","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":"min","year":"2017","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/90\/8869948\/08809410.pdf?arnumber=8809410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:14:53Z","timestamp":1657746893000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/8809410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":51,"journal-issue":{"issue":"5"},"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1109\/tnet.2019.2933868","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}