{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T18:18:52Z","timestamp":1782929932559,"version":"3.54.5"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"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":[[2019,4]]},"DOI":"10.1109\/infocom.2019.8737499","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T00:35:56Z","timestamp":1560818156000},"page":"2026-2034","source":"Crossref","is-referenced-by-count":134,"title":["MV-Sketch: A Fast and Compact Invertible Sketch for Heavy Flow Detection in Network Data Streams"],"prefix":"10.1109","author":[{"given":"Lu","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick P. C.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633055"},{"key":"ref32","article-title":"Software Defined Traffic Measurement with OpenSketch","author":"yu","year":"2013","journal-title":"Proc of USENIX NSDI"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3063772"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1330107.1330117"},{"key":"ref10","article-title":"Finding Frequent Items in Data Streams","author":"charikar","year":"2002","journal-title":"Proc of ICALP"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065201"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.860096"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.132"},{"key":"ref15","article-title":"HeavyKeeper: An Accurate Algorithm for Finding Top-k Elephant Flows","author":"gong","year":"2018","journal-title":"Proc of USENIX ATC"},{"key":"ref16","article-title":"Invertible Bloom Lookup Tables","author":"goodrich","year":"2015","journal-title":"ArXiv"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.08.025"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230559"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807101"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057216"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836099"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524364"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896150"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057215"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.06.018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3488-0_5"},{"key":"ref2","year":"0"},{"key":"ref9","year":"0","journal-title":"CAIDA"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3185467.3185475"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2558958"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195691"},{"key":"ref23","article-title":"FlowRadar: a Better NetFlow for Data Centers","author":"li","year":"2016","journal-title":"Proc of USENIX NSDI"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8732929\/8737365\/08737499.pdf?arnumber=8737499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:15:49Z","timestamp":1657854949000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8737499\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/infocom.2019.8737499","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}