{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:18Z","timestamp":1763468298800,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T00:00:00Z","timestamp":1447632000000},"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":[[2015,11,16]]},"DOI":"10.1145\/2834050.2834098","type":"proceedings-article","created":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T16:29:04Z","timestamp":1447086544000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Enabling a \"RISC\" Approach for Software-Defined Monitoring using Universal Streaming"],"prefix":"10.1145","author":[{"given":"Zaoxing","family":"Liu","sequence":"first","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Greg","family":"Vorsanger","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Vladimir","family":"Braverman","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]},{"given":"Vyas","family":"Sekar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"320","published-online":{"date-parts":[[2015,11,16]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"The caida ucsd anonymized internet traces 2015 - sanjose dira. http:\/\/www.caida.org\/data\/passive\/passive_2015_dataset.xml.  The caida ucsd anonymized internet traces 2015 - sanjose dira. http:\/\/www.caida.org\/data\/passive\/passive_2015_dataset.xml."},{"key":"e_1_3_2_2_2_1","unstructured":"Opensketch simulation library. https:\/\/github.com\/USC-NSL\/opensketch.  Opensketch simulation library. https:\/\/github.com\/USC-NSL\/opensketch."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247510"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177101"},{"key":"e_1_3_2_2_7_1","unstructured":"V.\n      Braverman\n     and \n      S. R.\n      Chestnut\n  . \n  Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums\n  . In N. Garg K. Jansen A. Rao and J. D. P. Rolim editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM \n  2015\n  ) volume \n  40\n   of \n  Leibniz International Proceedings in Informatics (LIPIcs) pages \n  591\n  --\n  605 Dagstuhl Germany 2015. Schloss Dagstuhl--Leibniz-Zentrum fuer \n  Informatik\n  .  V. Braverman and S. R. Chestnut. Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums. In N. Garg K. Jansen A. Rao and J. D. P. Rolim editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2015) volume 40 of Leibniz International Proceedings in Informatics (LIPIcs) pages 591--605 Dagstuhl Germany 2015. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_2_8_1","first-page":"531","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 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(1-2\/k)) bits . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2014 , September 4--6, 2014, Barcelona, Spain , pages 531 -- 544 , 2014. V. Braverman, J. Katzman, C. Seidell, and G. Vorsanger. An optimal algorithm for large frequency moments using o(n(1-2\/k)) bits. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2014, September 4--6, 2014, Barcelona, Spain, pages 531--544, 2014."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806729"},{"key":"e_1_3_2_2_10_1","first-page":"42","volume-title":"APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings","author":"Braverman V.","year":"2013","unstructured":"V. Braverman and R. Ostrovsky . Approximating large frequency moments with pick-and-drop sampling. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop , APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings , pages 42 -- 57 , 2013 . V. Braverman and R. Ostrovsky. Approximating large frequency moments with pick-and-drop sampling. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings, pages 42--57, 2013."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-642-40328-6_5","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","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 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , pages 58 -- 70 . Springer , 2013 . V. Braverman and R. 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, pages 58--70. Springer, 2013."},{"key":"e_1_3_2_2_12_1","first-page":"573","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 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 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2015 , August 24--26, 2015, Princeton, NJ, USA , pages 573 -- 590 , 2015. V. Braverman, R. Ostrovsky, and A. Roytman. Zero-one laws for sliding windows and universal sketches. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2015, August 24--26, 2015, Princeton, NJ, USA, pages 573--590, 2015."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214414"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","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 , pages 693 -- 703 . Springer , 2002 . M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. In Automata, Languages and Programming, pages 693--703. Springer, 2002."},{"key":"e_1_3_2_2_15_1","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_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315492"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_2_20_1","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. https:\/\/software.intel.com\/en-us\/articles\/intel-performance-counter-monitor.  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. https:\/\/software.intel.com\/en-us\/articles\/intel-performance-counter-monitor."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863992"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_2_23_1","volume-title":"ACM","author":"Estan C.","year":"2002","unstructured":"C. Estan and G. Varghese . New directions in traffic measurement and accounting, volume 32 . ACM , 2002 . C. Estan and G. Varghese. New directions in traffic measurement and accounting, volume 32. ACM, 2002."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"e_1_3_2_2_26_1","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 . Available at: people. cs. umass. edu\/ mcgregor\/papers\/11-openproblems. pdf, 2011. P. Indyk, A. McGregor, I. Newman, and K. Onak. Open problems in data streams, property testing, and related topics, 2011. Available at: people. cs. umass. edu\/ mcgregor\/papers\/11-openproblems. pdf, 2011."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948236"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005686.1005709"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140295"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140295"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1452520.1452551"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896150"},{"key":"e_1_3_2_2_34_1","first-page":"233","volume-title":"NSDI","volume":"8","author":"Sekar V.","year":"2008","unstructured":"V. Sekar , M. K. Reiter , W. Willinger , H. Zhang , R. R. Kompella , and D. G. Andersen . csamp: A system for network-wide flow monitoring . In NSDI , volume 8 , pages 233 -- 246 , 2008 . V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen. csamp: A system for network-wide flow monitoring. In NSDI, volume 8, pages 233--246, 2008."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879186"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.23"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2482626.2482631"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2066987"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535411"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028802"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298345"}],"event":{"name":"HotNets-XIV: The 14th ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","CISCO"],"location":"Philadelphia PA USA","acronym":"HotNets-XIV"},"container-title":["Proceedings of the 14th ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834050.2834098","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2834050.2834098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:17Z","timestamp":1750225397000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2834050.2834098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,16]]},"references-count":41,"alternative-id":["10.1145\/2834050.2834098","10.1145\/2834050"],"URL":"https:\/\/doi.org\/10.1145\/2834050.2834098","relation":{},"subject":[],"published":{"date-parts":[[2015,11,16]]},"assertion":[{"value":"2015-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}