{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T21:18:23Z","timestamp":1776892703465,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T00:00:00Z","timestamp":1533600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,8,7]]},"DOI":"10.1145\/3230543.3230544","type":"proceedings-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T19:13:06Z","timestamp":1533755586000},"page":"561-575","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":539,"title":["Elastic sketch"],"prefix":"10.1145","author":[{"given":"Tong","family":"Yang","sequence":"first","affiliation":[{"name":"Peking University"}]},{"given":"Jie","family":"Jiang","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Peng","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Qun","family":"Huang","sequence":"additional","affiliation":[{"name":"Institute Of Computing Technology, CAS"}]},{"given":"Junzhi","family":"Gong","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Rui","family":"Miao","sequence":"additional","affiliation":[{"name":"Alibaba Group"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[{"name":"Peking University"}]},{"given":"Steve","family":"Uhlig","sequence":"additional","affiliation":[{"name":"Queen Mary University of London"}]}],"member":"320","published-online":{"date-parts":[[2018,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287400"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934906"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098832"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177099"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061956"},{"key":"e_1_3_2_1_8_1","volume-title":"Sketch techniques for approximate query processing. Foundations and Trends in Databases","author":"Cormode Graham","year":"2011","unstructured":"Graham Cormode . Sketch techniques for approximate query processing. Foundations and Trends in Databases . NOW publishers, 2011 . Graham Cormode. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_11_1","volume-title":"NSDI","volume":"13","author":"Yu Minlan","year":"2013","unstructured":"Minlan Yu , Lavanya Jose , and Rui Miao . Software defined traffic measurement with opensketch . In NSDI , volume 13 , 2013 . Minlan Yu, Lavanya Jose, and Rui Miao. Software defined traffic measurement with opensketch. In NSDI, volume 13, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098831"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384529.1375472"},{"key":"e_1_3_2_1_14_1","volume-title":"Finding frequent items in data streams. Automata, languages and programming","author":"Charikar Moses","year":"2002","unstructured":"Moses Charikar , Kevin Chen , and Martin Farach-Colton . Finding frequent items in data streams. Automata, languages and programming , 2002 . Moses Charikar, Kevin Chen, and Martin Farach-Colton. Finding frequent items in data streams. Automata, languages and programming, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3050220.3063772"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005709"},{"key":"e_1_3_2_1_18_1","volume-title":"NSDI","author":"Li Yuliang","year":"2016","unstructured":"Yuliang Li , Rui Miao , Changhoon Kim , and Minlan Yu. Flowradar : A better netflow for data centers . In NSDI , 2016 . Yuliang Li, Rui Miao, Changhoon Kim, and Minlan Yu. Flowradar: A better netflow for data centers. In NSDI, 2016."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787472"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"e_1_3_2_1_21_1","volume-title":"NSDI","author":"Zhang Zheng","year":"2010","unstructured":"Zheng Zhang , Ming Zhang , Albert G Greenberg , Y Charlie Hu , Ratul Mahajan , and Blaine Christian . Optimizing cost and performance in online service provider networks . In NSDI , 2010 . Zheng Zhang, Ming Zhang, Albert G Greenberg, Y Charlie Hu, Ratul Mahajan, and Blaine Christian. Optimizing cost and performance in online service provider networks. In NSDI, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592600"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987443.2987481"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592692"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2797094"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2761704"},{"key":"e_1_3_2_1_27_1","volume-title":"On-line anomaly detection with high accuracy","author":"Xie Kun","year":"2018","unstructured":"Kun Xie , Xiaocan Li , Xin Wang , and On-line anomaly detection with high accuracy . IEEE\/ACM Transactions on Networking , 2018 . Kun Xie, Xiaocan Li, Xin Wang, and et al. On-line anomaly detection with high accuracy. IEEE\/ACM Transactions on Networking, 2018."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934891"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 7th USENIX conference on Networked systems design and implementation. USENIX Association","author":"Mitzenmacher Michael","year":"2010","unstructured":"Michael Mitzenmacher , George Varghese , : scalable logging for intrusion prevention systems . In Proceedings of the 7th USENIX conference on Networked systems design and implementation. USENIX Association , 2010 . Michael Mitzenmacher, George Varghese, et al. Carousel: scalable logging for intrusion prevention systems. In Proceedings of the 7th USENIX conference on Networked systems design and implementation. USENIX Association, 2010."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/167954.166255"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2009.82"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2010.5680142"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.102"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_35_1","volume-title":"A manifesto for modeling and measurement in social media. First Monday, 15(9)","author":"Cormode Graham","year":"2010","unstructured":"Graham Cormode , Balachander Krishnamurthy , and Walter Willinger . A manifesto for modeling and measurement in social media. First Monday, 15(9) , 2010 . Graham Cormode, Balachander Krishnamurthy, and Walter Willinger. A manifesto for modeling and measurement in social media. First Monday, 15(9), 2010."},{"key":"e_1_3_2_1_36_1","volume-title":"NSDI","author":"Benson Theophilus","year":"2009","unstructured":"Theophilus Benson , Aditya Akella , and David A Maltz . Unraveling the complexity of network management . In NSDI , 2009 . Theophilus Benson, Aditya Akella, and David A Maltz. Unraveling the complexity of network management. In NSDI, 2009."},{"key":"e_1_3_2_1_37_1","volume-title":"Dynamic prioritization of traffic in home networks","author":"Bozkurt Ilker Nadi","year":"2015","unstructured":"Ilker Nadi Bozkurt , Yilun Zhou , Theophilus Benson , Bilal Anwer , Dave Levin , Nick Feamster , Aditya Akella , Balakrishnan Chandrasekaran , Cheng Huang , Bruce Maggs , Dynamic prioritization of traffic in home networks . 2015 . Ilker Nadi Bozkurt, Yilun Zhou, Theophilus Benson, Bilal Anwer, Dave Levin, Nick Feamster, Aditya Akella, Balakrishnan Chandrasekaran, Cheng Huang, Bruce Maggs, et al. Dynamic prioritization of traffic in home networks. 2015."},{"key":"e_1_3_2_1_38_1","unstructured":"Open-source p4 implementation of features typical of an advanced l2\/l3 switch. https:\/\/github.com\/p4lang\/switch.  Open-source p4 implementation of features typical of an advanced l2\/l3 switch. https:\/\/github.com\/p4lang\/switch."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACII.2013.47"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934879"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098829"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787496"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626291"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"e_1_3_2_1_46_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Braverman Vladimir","year":"2013","unstructured":"Vladimir Braverman and Rafail Ostrovsky . Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 2013 . Vladimir Braverman and Rafail Ostrovsky. Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 2013."},{"key":"e_1_3_2_1_47_1","unstructured":"The source codes of our and other related algorithms. https:\/\/github.com\/BlockLiu\/ElasticSketchCode.  The source codes of our and other related algorithms. https:\/\/github.com\/BlockLiu\/ElasticSketchCode."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.06.018"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080114"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-765-3_9"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535379"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592820"},{"key":"e_1_3_2_1_55_1","volume-title":"USENIX","author":"Lim Hyeontaek","year":"2014","unstructured":"Hyeontaek Lim , Donsu Han , David G Andersen , and Michael Kaminsky . Mica : A holistic approach to fast in-memory key-value storage . USENIX , 2014 . Hyeontaek Lim, Donsu Han, David G Andersen, and Michael Kaminsky. Mica: A holistic approach to fast in-memory key-value storage. USENIX, 2014."},{"key":"e_1_3_2_1_56_1","volume-title":"NSDI","volume":"13","author":"Fan Bin","year":"2013","unstructured":"Bin Fan , David G Andersen , and Michael Kaminsky . Memc3 : Compact and concurrent memcache with dumber caching and smarter hashing . In NSDI , volume 13 , 2013 . Bin Fan, David G Andersen, and Michael Kaminsky. Memc3: Compact and concurrent memcache with dumber caching and smarter hashing. In NSDI, volume 13, 2013."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043558"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2004.1378222"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025112"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486425"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901451"},{"key":"e_1_3_2_1_63_1","first-page":"4","volume-title":"World's fastest","author":"Barefoot","unstructured":"Barefoot tofino : World's fastest p 4 --programmable ethernet switch asics. https:\/\/barefootnetworks.com\/products\/brief-tofino\/. Barefoot tofino: World's fastest p4--programmable ethernet switch asics. https:\/\/barefootnetworks.com\/products\/brief-tofino\/."},{"key":"e_1_3_2_1_64_1","unstructured":"Nvidia cuda c programming guide version 9.0. http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html.  Nvidia cuda c programming guide version 9.0. http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html."},{"key":"e_1_3_2_1_65_1","unstructured":"The CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/.  The CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/2390948.2391070"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028814"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140295"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.5555\/1603899.1603924"},{"key":"e_1_3_2_1_70_1","unstructured":"FAST platform website. http:\/\/www.fastswitch.org.  FAST platform website. http:\/\/www.fastswitch.org."}],"event":{"name":"SIGCOMM '18: ACM SIGCOMM 2018 Conference","location":"Budapest Hungary","acronym":"SIGCOMM '18","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230543.3230544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3230543.3230544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:23Z","timestamp":1750210763000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3230543.3230544"}},"subtitle":["adaptive and fast network-wide measurements"],"short-title":[],"issued":{"date-parts":[[2018,8,7]]},"references-count":70,"alternative-id":["10.1145\/3230543.3230544","10.1145\/3230543"],"URL":"https:\/\/doi.org\/10.1145\/3230543.3230544","relation":{},"subject":[],"published":{"date-parts":[[2018,8,7]]},"assertion":[{"value":"2018-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}