{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T21:18:17Z","timestamp":1776892697814,"version":"3.51.2"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11432-010-0053-5","type":"journal-article","created":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T14:55:55Z","timestamp":1269528955000},"page":"659-676","source":"Crossref","is-referenced-by-count":12,"title":["Identifying heavy hitters in high-speed network monitoring"],"prefix":"10.1007","volume":"53","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BinXing","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YongZheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,26]]},"reference":[{"key":"53_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/637201.637226","volume-title":"Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement","author":"R. Sommer","year":"2002","unstructured":"Sommer R, Feldmann A. NetFlow: Information loss or win? In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurement. New York: ACM, 2002. 173\u2013174"},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/964723.383068","volume":"31","author":"S. Fred","year":"2001","unstructured":"Fred S, Bonald T, Proutiere A, et al. Statistical bandwidth sharing: A study of congestion at flow level. ACM SIGCOMM Comput Commun Rev, 2001, 31: 111\u2013122","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/SAINT.2004.1266104","volume-title":"Proceedings of the 2004 International Symposium on Applications and the Internet","author":"T. Mori","year":"2004","unstructured":"Mori T, Kawahara S, Naito S, et al. On the characteristics of Internet traffic variability: Spikes and elephants. In: Proceedings of the 2004 International Symposium on Applications and the Internet. Tokyo: IEEE, 2004. 99\u2013106"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Papagiannaki K, Taft N, Bhattachayya S, et al. On the feasibility of identifying elephants in Internet backbone traffic. Sprint ATL Technical Report TR01-ATL-110918, 2001","DOI":"10.1145\/637201.637227"},{"key":"53_CR5","first-page":"309","volume-title":"Proceedings of the 2002 SIGCOMM Conference","author":"Y. Zhang","year":"2002","unstructured":"Zhang Y, Breslau L, Paxson V, et al. On the characteristics and origins of internet flow rates. In: Proceedings of the 2002 SIGCOMM Conference. New York: ACM, 2002. 309\u2013322"},{"key":"53_CR6","first-page":"1859","volume-title":"Proceedings of GLOBECOM\u201999","author":"W. J. Fang","year":"1999","unstructured":"Fang W J, Peterson L. Inter-AS traffic patterns and their implications. In: Proceedings of GLOBECOM\u201999. Rio de Janeireo: IEEE, 1999. 1859\u20131868"},{"key":"53_CR7","first-page":"192","volume-title":"Proceedings of IEEE ICNP\u201901","author":"R. Mahajan","year":"2001","unstructured":"Mahajan R, Floyd S, Wetherall D. Controlling high-bandwidth flows at the congested router. In: Proceedings of IEEE ICNP\u201901. Washington: IEEE, 2001. 192"},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/90.929850","volume":"9","author":"A. Feldmann","year":"2001","unstructured":"Feldmann A, Greenberg A, Lund C, et al. Deriving traffic demands for operational IP networks: Methodology and experience. IEEE\/ACM Trans Netw (ToN), 2001, 9: 265\u2013280","journal-title":"IEEE\/ACM Trans Netw (ToN)"},{"key":"53_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan C, Varghese G. New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Trans Comput Syst (ToCS), 2003, 21: 270\u2013313","journal-title":"ACM Trans Comput Syst (ToCS)"},{"key":"53_CR10","first-page":"3060","volume":"18","author":"F. Y. Wang","year":"2007","unstructured":"Wang F Y, Yun X C, Wang X F, et al. Identifying heavy hitters in high-speed network monitoring (in Chinese). J Softw, 2007, 18: 3060\u20133070","journal-title":"J Softw"},{"key":"53_CR11","first-page":"2487","volume":"29","author":"H. B. Wang","year":"2007","unstructured":"Wang H B, Pei Y J, Lin Y, et al. A LRU based algorithm for identifying and measuring large flows (in Chinese). J Electron Inf Tech, 2007, 29: 2487\u20132492","journal-title":"J Electron Inf Tech"},{"key":"53_CR12","first-page":"684","volume":"37","author":"Y. J. Pei","year":"2009","unstructured":"Pei Y J, Wang H B, Cheng S D, et al. A dual-LRU based algorithm for identifying and measuring large flows (in Chinese). Acta Electron Sin, 2009, 37: 684\u2013691","journal-title":"Acta Electron Sin"},{"key":"53_CR13","first-page":"271","volume-title":"Proceedings of the 8th ACM SIGCOMM Workshop on Internet Measurement","author":"F. Raspall","year":"2008","unstructured":"Raspall F, Sallent S. Adaptive shared-state sampling. In: Proceedings of the 8th ACM SIGCOMM Workshop on Internet Measurement. New York: ACM, 2008. 271\u2013284"},{"key":"53_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1005686.1005709","volume-title":"Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems","author":"A. Kumar","year":"2004","unstructured":"Kumar A, Sung M, Xu J, et al. Data streaming algorithms for efficient and accurate estimation of flow size distribution. In: Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems. New York: ACM, 2004. 177\u2013188"},{"key":"53_CR15","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A. Metwally","year":"2006","unstructured":"Metwally A, Agrawal D, El Abbadi A. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans Database Syst (TODS), 2006, 31: 1095\u20131133","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"53_CR16","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M. Charikar","year":"2004","unstructured":"Charikar M, Chen K, Farach-Colton M. Finding frequent items in data streams. Theor Comput Sci, 2004, 312: 3\u201315","journal-title":"Theor Comput Sci"},{"key":"53_CR17","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S. An improved data stream summary: The count-min sketch and its applications. J Algorithms, 2005, 55: 58\u201375","journal-title":"J Algorithms"},{"key":"53_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R. Karp","year":"2003","unstructured":"Karp R, Shenker S, Papadimitriou C. A simple algorithm for finding frequent elements in streams and bags. ACM Trans Database Syst (TODS), 2003, 28: 51\u201355","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"53_CR19","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/B978-155860869-6\/50038-X","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases","author":"G. Manku","year":"2002","unstructured":"Manku G, Motwani R. Approximate frequency counts over data streams. In: Proceedings of the 28th International Conference on Very Large Data Bases. Hong Kong: VLDB Endowment, 2002. 346\u2013357"},{"key":"53_CR20","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1360\/jos180884","volume":"18","author":"W. P. Wang","year":"2007","unstructured":"Wang W P, Li J Z, Zhang D D, et al. An efficient algorithm for mining approximate frequent item over data streams (in Chinese). J Software, 2007, 18: 884\u2013892","journal-title":"J Software"},{"key":"53_CR21","first-page":"287","volume-title":"Proceedings of the 12th International Conference on Information and Knowledge Management","author":"C. Jin","year":"2003","unstructured":"Jin C, Qian W, Sha C, et al. Dynamically maintaining frequent items over a data stream. In: Proceedings of the 12th International Conference on Information and Knowledge Management. New York: ACM, 2003. 287\u2013294"},{"key":"53_CR22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G. Cormode","year":"2005","unstructured":"Cormode G, Muthukrishnan S. What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically. ACM Trans Database Syst (TODS), 2005, 30: 249\u2013278","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"53_CR23","first-page":"1530","volume-title":"Proceedings of the VLDB Endowment","author":"G. Cormode","year":"2008","unstructured":"Cormode G, Hadjieleftheriou M. Finding frequent items in data streams. In: Proceedings of the VLDB Endowment. Auckland: VLDB Endowment, 2008. 1530\u20131541"},{"key":"53_CR24","first-page":"594","volume":"32","author":"Y. H. Pang","year":"2006","unstructured":"Pang Y H, Wang J L, Xu C F. State-of-the-art on frequent pattern mining in data streams (in Chinese). Acta Automat Sin, 2006, 32: 594\u2013602","journal-title":"Acta Automat Sin"},{"key":"53_CR25","unstructured":"Agilent Technologies. JTC 003: Mixed packet size throughput. J Internet Test Method, 2004, 16\u201318. Available at http:\/\/advanced.comms.agilent.com\/n2x\/docs\/journal\/index.htm"},{"key":"53_CR26","first-page":"88","volume-title":"Proceedings of 9th International Conference on Computer Communications and Networks","author":"Z. Cao","year":"2000","unstructured":"Cao Z, Wang Z. Flow identification for supporting per-flow queueing. In: Proceedings of 9th International Conference on Computer Communications and Networks. Las Vegas: IEEE, 2000. 88\u201393"},{"key":"53_CR27","unstructured":"Cormode G, Hadjieleftheriou M. Finding frequent items in data streams: Source code. http:\/\/www.research.att.com\/~marioh\/frequent-items\/index.html"},{"key":"53_CR28","unstructured":"Cormode G, Muthukrishnan S. MassDAL public code bank. http:\/\/www.cs.rutgers.edu\/~muthu\/massdal.html"},{"key":"53_CR29","unstructured":"CAIDA anonymized OC48 Internet traces dataset. http:\/\/www.caida.org\/data\/passive\/passive oc48 dataset.xml"},{"key":"53_CR30","unstructured":"CAIDA anonymized 2008 Internet traces dataset. http:\/\/www.caida.org\/data\/passive\/passive 2008 dataset.xml"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0053-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-0053-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-0053-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T07:10:23Z","timestamp":1685517023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-0053-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-0053-5","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}