{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:38:37Z","timestamp":1774539517754,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T00:00:00Z","timestamp":1471824000000},"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":[[2016,8,22]]},"DOI":"10.1145\/2934872.2934906","type":"proceedings-article","created":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T16:06:52Z","timestamp":1470067612000},"page":"101-114","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":466,"title":["One Sketch to Rule Them All"],"prefix":"10.1145","author":[{"given":"Zaoxing","family":"Liu","sequence":"first","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Antonis","family":"Manousis","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Gregory","family":"Vorsanger","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Vyas","family":"Sekar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Vladimir","family":"Braverman","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]}],"member":"320","published-online":{"date-parts":[[2016,8,22]]},"reference":[{"key":"e_1_3_2_2_1_2","unstructured":"Caida internet traces 2014 sanjose. http:\/\/goo.gl\/uP5aqG.  Caida internet traces 2014 sanjose. http:\/\/goo.gl\/uP5aqG."},{"key":"e_1_3_2_2_2_2","unstructured":"Caida internet traces 2015 chicago. http:\/\/goo.gl\/xgIUmF.  Caida internet traces 2015 chicago. http:\/\/goo.gl\/xgIUmF."},{"key":"e_1_3_2_2_3_2","unstructured":"Intel flexpipe. http:\/\/goo.gl\/H5qPP2.  Intel flexpipe. http:\/\/goo.gl\/H5qPP2."},{"key":"e_1_3_2_2_4_2","unstructured":"Netfpga technical specifications. http:\/\/netfpga.org\/1G_specs.html.  Netfpga technical specifications. http:\/\/netfpga.org\/1G_specs.html."},{"key":"e_1_3_2_2_5_2","unstructured":"Opensketch simulation library. https:\/\/goo.gl\/kyQ80q.  Opensketch simulation library. https:\/\/goo.gl\/kyQ80q."},{"key":"e_1_3_2_2_6_2","unstructured":"P4 behavioral simulator. https:\/\/github.com\/p4lang\/p4factory.  P4 behavioral simulator. https:\/\/github.com\/p4lang\/p4factory."},{"key":"e_1_3_2_2_7_2","unstructured":"P4 specification. http:\/\/goo.gl\/5ttjpA.  P4 specification. http:\/\/goo.gl\/5ttjpA."},{"key":"e_1_3_2_2_8_2","unstructured":"Why big data needs big buffer switches. https:\/\/goo.gl\/ejWUIq.  Why big data needs big buffer switches. https:\/\/goo.gl\/ejWUIq."},{"key":"e_1_3_2_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247510"},{"key":"e_1_3_2_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2656877.2656890"},{"key":"e_1_3_2_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486011"},{"key":"e_1_3_2_2_14_2","volume-title":"APPROX\/RANDOM","author":"Braverman V.","year":"2015","unstructured":"V. Braverman and S. R. Chestnut . Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums . In APPROX\/RANDOM , 2015 . V. Braverman and S. R. Chestnut. Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums. In APPROX\/RANDOM, 2015."},{"key":"e_1_3_2_2_15_2","volume-title":"CoRR","author":"Braverman V.","year":"2015","unstructured":"V. Braverman , S. R. Chestnut , R. Krauthgamer , and L. F. Yang . Streaming symmetric norms via measure concentration . CoRR , 2015 . V. Braverman, S. R. Chestnut, R. Krauthgamer, and L. F. Yang. Streaming symmetric norms via measure concentration. CoRR, 2015."},{"key":"e_1_3_2_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902282"},{"key":"e_1_3_2_2_17_2","volume-title":"APPROX\/RANDOM","author":"Braverman V.","year":"2014","unstructured":"V. Braverman , J. Katzman , C. Seidell , and G. Vorsanger . An optimal algorithm for large frequency moments using o(n\u0302(1-2\/k)) bits . In APPROX\/RANDOM , 2014 . V. Braverman, J. Katzman, C. Seidell, and G. Vorsanger. An optimal algorithm for large frequency moments using o(n\u0302(1-2\/k)) bits. In APPROX\/RANDOM, 2014."},{"key":"e_1_3_2_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48054-0_13"},{"key":"e_1_3_2_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806729"},{"key":"e_1_3_2_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_4"},{"key":"e_1_3_2_2_21_2","volume-title":"APPROX\/RAMDOM.","author":"Braverman V.","year":"2013","unstructured":"V. Braverman and R. Ostrovsky . Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams . In APPROX\/RAMDOM. 2013 . V. Braverman and R. Ostrovsky. Generalizing the layering method of indyk and woodruff: Recursive sketches for frequency-based vectors on streams. In APPROX\/RAMDOM. 2013."},{"key":"e_1_3_2_2_22_2","volume-title":"APPROX\/RANDOM","author":"Braverman V.","year":"2015","unstructured":"V. Braverman , R. Ostrovsky , and A. Roytman . Zero-one laws for sliding windows and universal sketches . In APPROX\/RANDOM , 2015 . V. Braverman, R. Ostrovsky, and A. Roytman. Zero-one laws for sliding windows and universal sketches. In APPROX\/RANDOM, 2015."},{"key":"e_1_3_2_2_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_2_24_2","volume-title":"Automata, Languages and Programming.","author":"Charikar M.","year":"2002","unstructured":"M. Charikar , K. Chen , and M. Farach-Colton . Finding frequent items in data streams . In Automata, Languages and Programming. 2002 . M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Automata, Languages and Programming. 2002."},{"key":"e_1_3_2_2_25_2","unstructured":"B. Claise. Cisco systems netflow services export version 9. RFC 3954.  B. Claise. Cisco systems netflow services export version 9. RFC 3954."},{"key":"e_1_3_2_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"e_1_3_2_2_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_2_29_2","unstructured":"R. Dementiev T. Willhalm O. Bruggeman P. Fay P. Ungerer A. Ott P. Lu J. Harris P. Kerly P. Konsor A. Semin M. Kanaly R. Brazones and R. Shah. Intel performance counter monitor - a better way to measure cpu utilization. http:\/\/goo.gl\/tQ5gxa.  R. Dementiev T. Willhalm O. Bruggeman P. Fay P. Ungerer A. Ott P. Lu J. Harris P. Kerly P. Konsor A. Semin M. Kanaly R. Brazones and R. Shah. Intel performance counter monitor - a better way to measure cpu utilization. http:\/\/goo.gl\/tQ5gxa."},{"key":"e_1_3_2_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863992"},{"key":"e_1_3_2_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"e_1_3_2_2_33_2","volume-title":"Open problems in data streams, property testing, and related topics","author":"Indyk P.","year":"2011","unstructured":"P. Indyk , A. McGregor , I. Newman , and K. Onak . Open problems in data streams, property testing, and related topics . 2011 . P. Indyk, A. McGregor, I. Newman, and K. Onak. Open problems in data streams, property testing, and related topics. 2011."},{"key":"e_1_3_2_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535373"},{"key":"e_1_3_2_2_35_2","author":"Knight S.","year":"2011","unstructured":"S. Knight , H. Nguyen , N. Falkner , R. Bowden , and M. Roughan . The internet topology zoo. Selected Areas in Communications, IEEE Journal on, october 2011 . S. Knight, H. Nguyen, N. Falkner, R. Bowden, and M. Roughan. The internet topology zoo. Selected Areas in Communications, IEEE Journal on, october 2011.","journal-title":"The internet topology zoo. Selected Areas in Communications, IEEE Journal on, october"},{"key":"e_1_3_2_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_3_2_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005709"},{"key":"e_1_3_2_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140295"},{"key":"e_1_3_2_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2834050.2834098"},{"key":"e_1_3_2_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836099"},{"key":"e_1_3_2_2_42_2","volume-title":"Proc., HotNets","author":"Pfaff B.","year":"2009","unstructured":"B. Pfaff , J. Pettit , T. Koponen , K. Amidon , M. Casado , and S. Shenker . Extending networking into the virtualization layer . In Proc., HotNets , 2009 . B. Pfaff, J. Pettit, T. Koponen, K. Amidon, M. Casado, and S. Shenker. Extending networking into the virtualization layer. In Proc., HotNets, 2009."},{"key":"e_1_3_2_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452551"},{"key":"e_1_3_2_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028814"},{"key":"e_1_3_2_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879186"},{"key":"e_1_3_2_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.23"},{"key":"e_1_3_2_2_47_2","volume-title":"Proc., NSDI","author":"Yu M.","year":"2013","unstructured":"M. Yu , L. Jose , and R. Miao . Software defined traffic measurement with opensketch . In Proc., NSDI , 2013 . M. Yu, L. Jose, and R. Miao. Software defined traffic measurement with opensketch. In Proc., NSDI, 2013."},{"key":"e_1_3_2_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2066987"},{"key":"e_1_3_2_2_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535411"},{"key":"e_1_3_2_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298345"},{"key":"e_1_3_2_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447825"}],"event":{"name":"SIGCOMM '16: ACM SIGCOMM 2016 Conference","location":"Florianopolis Brazil","acronym":"SIGCOMM '16","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2016 ACM SIGCOMM Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934872.2934906","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2934872.2934906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:48Z","timestamp":1750217988000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2934872.2934906"}},"subtitle":["Rethinking Network Flow Monitoring with UnivMon"],"short-title":[],"issued":{"date-parts":[[2016,8,22]]},"references-count":51,"alternative-id":["10.1145\/2934872.2934906","10.1145\/2934872"],"URL":"https:\/\/doi.org\/10.1145\/2934872.2934906","relation":{},"subject":[],"published":{"date-parts":[[2016,8,22]]},"assertion":[{"value":"2016-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}