{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:23:20Z","timestamp":1761402200212,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T00:00:00Z","timestamp":1624579200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,25]]},"DOI":"10.1109\/iwqos52092.2021.9521269","type":"proceedings-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T20:59:51Z","timestamp":1630011591000},"page":"1-10","source":"Crossref","is-referenced-by-count":4,"title":["Supporting Flow-Cardinality Queries with O(1) Time Complexity in High-speed Networks"],"prefix":"10.1109","author":[{"given":"Qingjun","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Xiongqin","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"HyperLogLog: The analysis of a near-optimal cardinality estimation algorithm","author":"flajolet","year":"2007","journal-title":"Proc of AOFA"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/INFCOM.2007.305"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1145\/1028788.1028813"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/INFCOM.2011.5934979"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/INFCOM.2010.5461921"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/INFCOM.2009.5061958"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref17","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"Proc of ICDT"},{"key":"ref18","first-page":"311","article-title":"Linking the negative binomial and logarithmic series distributions via their associated series","volume":"31","author":"sadinle","year":"2008","journal-title":"Rev Colombiana Estadística"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/3050220.3063772"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/3139645.3139648"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1145\/2785956.2787483"},{"key":"ref3","article-title":"Micro TE: Fine grained traffic engineering for data centers","author":"benson","year":"2011","journal-title":"Proc of CoNext"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/3-540-45465-9_59"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/INFCOM.2009.5061990"},{"year":"2020","author":"ding","journal-title":"Estimating logarithmic and exponential functions to track network traffic entropy in p4","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.jalgor.2003.12.001"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2619239.2626316"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/978-3-540-39658-1_55"},{"year":"0","journal-title":"CAIDA UCSD anonymized 2017 internet traces on Jan 17","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/INFOCOM41043.2020.9155525"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/78922.78925"},{"key":"ref21","article-title":"New streaming algorithms for fast detection of superspreaders","author":"venkataraman","year":"2005","journal-title":"Proc of NDSS"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/2745844.2745870"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1017\/CBO9781139164795"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/INFOCOM.2018.8485804"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/INFCOM.2009.5061956"}],"event":{"name":"2021 IEEE\/ACM 29th International Symposium on Quality of Service (IWQOS)","start":{"date-parts":[[2021,6,25]]},"location":"Tokyo, Japan","end":{"date-parts":[[2021,6,28]]}},"container-title":["2021 IEEE\/ACM 29th International Symposium on Quality of Service (IWQOS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9521186\/9521256\/09521269.pdf?arnumber=9521269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:45:16Z","timestamp":1652197516000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9521269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,25]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iwqos52092.2021.9521269","relation":{},"subject":[],"published":{"date-parts":[[2021,6,25]]}}}