{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T18:18:45Z","timestamp":1782929925825,"version":"3.54.5"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1719222,STC-1562485"],"award-info":[{"award-number":["CNS-1719222,STC-1562485"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2019,12,17]]},"abstract":"<jats:p>Traffic measurement provides critical information for network management, resource allocation, traffic engineering, and attack detection. Most prior art has been geared towards specific application needs with specific performance objectives. To support diverse requirements with efficient and future-proof implementation, this paper takes a new approach to establish common frameworks, each for a family of traffic measurement solutions that share the same implementation structure, providing a high level of generality, for both size and spread measurements and for all flows. The designs support many options of performance-overhead tradeoff with as few as one memory update per packet and as little space as several bits per flow on average. Such a family-based approach will unify implementation by removing redundancy from different measurement tasks and support reconfigurability in a plug-n-play manner. We demonstrate the connection and difference in the design of these traffic measurement families and perform experimental comparisons on hardware\/software platforms to find their tradeoff, which provide practical guidance for which solutions to use under given performance goals.<\/jats:p>","DOI":"10.1145\/3366699","type":"journal-article","created":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T13:21:11Z","timestamp":1576675271000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":52,"title":["Generalized Sketch Families for Network Traffic Measurement"],"prefix":"10.1145","volume":"3","author":[{"given":"You","family":"Zhou","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youlin","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoyi","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shigang","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Olufemi O.","family":"Odegbile","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proc. of IEEE International Conference on Distributed Computing Systems(ICDCS) (June","author":"Bandi N.","year":"2007"},{"key":"e_1_2_1_2_1","volume-title":"Proc. of RANDOM: Workshop on Randomization and Approximation","author":"Z.","year":"2002"},{"key":"e_1_2_1_3_1","volume-title":"Proc. of ACM SIGCOMM","author":"Basat R. B.","year":"2017"},{"key":"e_1_2_1_4_1","volume-title":"Proc. of STOC","author":"Braverman V.","year":"2010"},{"key":"e_1_2_1_5_1","volume-title":"Proc. of IEEE INFOCOM (April","author":"Cao J.","year":"2009"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_59"},{"key":"e_1_2_1_7_1","volume-title":"Proc. of IEEE ICDCS (March","author":"Chen S.","year":"2004"},{"key":"e_1_2_1_8_1","unstructured":"Cisco. Online. Cisco IOS NetFlow . http:\/\/www.cisco.com\/c\/en\/us\/products\/ios-nx-os-software\/ios-netflow\/index.html  Cisco. Online. Cisco IOS NetFlow . http:\/\/www.cisco.com\/c\/en\/us\/products\/ios-nx-os-software\/ios-netflow\/index.html"},{"key":"e_1_2_1_9_1","volume-title":"Proc. of ACM SIGMOD (June","author":"Cohen S.","year":"2003"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508857.1508863"},{"key":"e_1_2_1_11_1","unstructured":"G. Cormode. 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers (2011).  G. Cormode. 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers (2011)."},{"key":"e_1_2_1_12_1","volume-title":"Proc. of LATIN","author":"Cormode G.","year":"2004"},{"key":"e_1_2_1_13_1","volume-title":"Proc. of ACM PODS (June","author":"Cormode G.","year":"2005"},{"key":"e_1_2_1_14_1","volume-title":"Proc. of Annual European Symposium on Algorithms (ESA) (September","author":"Demaine E.","year":"2002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341431.1341433"},{"key":"e_1_2_1_16_1","volume-title":"Proc. of ACM SIGCOMM (October","author":"Duffield N.","year":"2003"},{"key":"e_1_2_1_17_1","volume-title":"ESA: European Symposia on Algorithms","author":"Durand M.","year":"2003"},{"key":"e_1_2_1_18_1","volume-title":"Proc. of ACM SIGCOMM","author":"Estan C.","year":"2004"},{"key":"e_1_2_1_19_1","volume-title":"Proc. of ACM SIGCOMM (August","author":"Estan C.","year":"2002"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.882836"},{"key":"e_1_2_1_21_1","volume-title":"Proc. of AOFA","author":"Flajolet P.","year":"2007"},{"key":"e_1_2_1_22_1","volume-title":"Probabilistic Counting Algorithms for Database Applications. J. Comput. System Sci.","volume":"31","author":"Flajolet P.","year":"1985"},{"key":"e_1_2_1_23_1","volume-title":"Proc. of ACM Conference on Security Symposium","author":"Gu G.","year":"2008"},{"key":"e_1_2_1_24_1","volume-title":"Proc. of Network and Distributed System Security Symposium","author":"Gu G.","year":"2008"},{"key":"e_1_2_1_25_1","volume-title":"Proc. of ACM SIGMETRICS\/Performance (June","author":"Hao F.","year":"2004"},{"key":"e_1_2_1_26_1","volume-title":"Proc. of EDBT","author":"Heule S.","year":"2013"},{"key":"e_1_2_1_27_1","volume-title":"Proc. of ACM SIGCOMM","author":"Huang Q.","year":"2017"},{"key":"e_1_2_1_28_1","volume-title":"Proc. of ACM SIGCOMM (August","author":"Huang Q.","year":"2018"},{"key":"e_1_2_1_29_1","volume-title":"Proc. of ACM SIGMETRICS (June","author":"Kumar A.","year":"2004"},{"key":"e_1_2_1_30_1","volume-title":"Proc. of IEEE INFOCOM (March 2004","author":"Kumar A.","year":"2006"},{"key":"e_1_2_1_31_1","volume-title":"Proc. of SIGMETRICS\/Performance","author":"Lall A.","year":"2006"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"T. Li S. Chen and Y. Ling. 2011. Fast and Compact Per-Flow Traffic Measurement through Randomized Counter Sharing . IEEE INFOCOM (2011).  T. Li S. Chen and Y. Ling. 2011. Fast and Compact Per-Flow Traffic Measurement through Randomized Counter Sharing . IEEE INFOCOM (2011).","DOI":"10.1109\/INFCOM.2011.5934979"},{"key":"e_1_2_1_33_1","volume-title":"Proc. of USENIX NSDI","author":"Li Y.","year":"2016"},{"key":"e_1_2_1_34_1","volume-title":"Proc. of ACM Sigcomm","author":"Liu Z.","year":"2016"},{"key":"e_1_2_1_35_1","volume-title":"Proc. of ACM SIGMETRICS (June","author":"Lu Y.","year":"2008"},{"key":"e_1_2_1_36_1","volume-title":"Proc. of IEEE INFOCOM (April","author":"Lu Y.","year":"2009"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633027"},{"key":"e_1_2_1_38_1","volume-title":"Proc. of ACM IMC","author":"Mai J.","year":"2006"},{"key":"e_1_2_1_39_1","volume-title":"Proc. of VLDB (August","author":"Manku G.","year":"2002"},{"key":"e_1_2_1_40_1","volume-title":"Proc. of IEEE INFOCOM (April","author":"Moore D.","year":"2003"},{"key":"e_1_2_1_41_1","volume-title":"Proc. of USENIX Security Symposium'2001 (August","author":"Moore D.","year":"2001"},{"key":"e_1_2_1_42_1","volume-title":"Proc. of ACM SIGCOMM","author":"Moshref M.","year":"2014"},{"key":"e_1_2_1_43_1","unstructured":"UF Networklab. Online. The Source Codes of Generalized Sketch Families . https:\/\/github.com\/mcynever\/GeneralizedSketchFamilies  UF Networklab. Online. The Source Codes of Generalized Sketch Families . https:\/\/github.com\/mcynever\/GeneralizedSketchFamilies"},{"key":"e_1_2_1_44_1","unstructured":"Nvidia. Online. Nvidia cuda c programming guide version 10.0 . http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html  Nvidia. Online. Nvidia cuda c programming guide version 10.0 . http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html"},{"key":"e_1_2_1_45_1","unstructured":"OVS. Online. Open vSwitch . https:\/\/www.openvswitch.org\/  OVS. Online. Open vSwitch . https:\/\/www.openvswitch.org\/"},{"key":"e_1_2_1_46_1","volume-title":"Proc. of ACM SIGCOMM'2001 (August","author":"Park K.","year":"2001"},{"key":"e_1_2_1_47_1","volume-title":"Proc. of USENIX LISA","author":"Plonka D.","year":"2000"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/1039834.1039864"},{"key":"e_1_2_1_49_1","volume-title":"Proc. of IMC","author":"Schweller R.","year":"2004"},{"key":"e_1_2_1_50_1","volume-title":"Proc. of USENIX Security Symposium (August","author":"Staniford S.","year":"2002"},{"key":"e_1_2_1_51_1","unstructured":"UCSD. 2015. CAIDA UCSD Anonymized 2015 Internet Traces on Jan. 17 . http:\/\/www.caida.org\/data\/passive\/passive_2015_dataset.xml .  UCSD. 2015. CAIDA UCSD Anonymized 2015 Internet Traces on Jan. 17 . http:\/\/www.caida.org\/data\/passive\/passive_2015_dataset.xml ."},{"key":"e_1_2_1_52_1","volume-title":"Proc. of NDSS (February","author":"Venkatataman S.","year":"2005"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2002.1022280"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"e_1_2_1_55_1","unstructured":"Wikipedia. Online. Chebyshev inequality . https:\/\/en.wikipedia.org\/wiki\/Chebyshev%27s_inequality  Wikipedia. Online. Chebyshev inequality . https:\/\/en.wikipedia.org\/wiki\/Chebyshev%27s_inequality"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745844.2745870"},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Q. Xiao S. Chen Y. Zhou M. Chen J. Luo T. Li and Y. Ling. 2017. Cardinality Estimation for Elephant Flows: A Compact Solution based on Virtual Register Sharing . IEEE\/ACM Transactions on Networking (2017).  Q. Xiao S. Chen Y. Zhou M. Chen J. Luo T. Li and Y. Ling. 2017. Cardinality Estimation for Elephant Flows: A Compact Solution based on Virtual Register Sharing . IEEE\/ACM Transactions on Networking (2017).","DOI":"10.1109\/TNET.2017.2753842"},{"key":"e_1_2_1_58_1","volume-title":"Proc. of ACM SIGCOMM (August","author":"Yang T.","year":"2018"},{"key":"e_1_2_1_59_1","volume-title":"Proc. of IEEE INFOCOM (April","author":"Yoon M.","year":"2009"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2080285"},{"key":"e_1_2_1_61_1","volume-title":"Proc. of USENIX Symposium on Networked Systems Design and Implementation","author":"Yu M.","year":"2013"},{"key":"e_1_2_1_62_1","volume-title":"Proc. of ACM SIGCOMM IMC (October","author":"Zhang Y.","year":"2004"},{"key":"e_1_2_1_63_1","volume-title":"Proc. of ACM SIGMETRICS","author":"Zhou Y.","year":"2017"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366699","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:39Z","timestamp":1750203879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12,17]]}},"alternative-id":["10.1145\/3366699"],"URL":"https:\/\/doi.org\/10.1145\/3366699","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"2019-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}