{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:02:00Z","timestamp":1773324120944,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T00:00:00Z","timestamp":1290470400000},"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":[[2011,1]]},"DOI":"10.1007\/s11432-010-4132-4","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T19:34:57Z","timestamp":1290540897000},"page":"23-37","source":"Crossref","is-referenced-by-count":6,"title":["An index-split Bloom filter for deep packet inspection"],"prefix":"10.1007","volume":"54","author":[{"given":"Kun","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DaFang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,23]]},"reference":[{"key":"4132_CR1","volume-title":"Proceedings of USENIX Workshop on Hot Topics in Security 2006","author":"V. Paxson","year":"2006","unstructured":"Paxson V, Asanovic K, Dharmapurikar S, et al. Rethinking hardware support for network analysis and intrusion prevention. In: Proceedings of USENIX Workshop on Hot Topics in Security 2006. Vancouver: USENIX Press, 2006"},{"key":"4132_CR2","volume-title":"Proceedings of ACM SIGCOMM 2001","author":"C. Estan","year":"2001","unstructured":"Estan C, Varghese G. New directions in traffic measurement and accounting. In: Proceedings of ACM SIGCOMM 2001. San Diego: ACM Press, 2001"},{"key":"4132_CR3","volume-title":"Proceedings of ACM SIGCOMM 2005","author":"K. Lakshminarayanan","year":"2005","unstructured":"Lakshminarayanan K, Rangarajan A, Venkatachary S. Algorithms for advanced packet classification with ternary CAMs. In: Proceedings of ACM SIGCOMM 2005. Philadelphia: ACM Press, 2005"},{"key":"4132_CR4","volume-title":"Proceedings of ACM SIGCOMM 2006","author":"F. Bonomi","year":"2006","unstructured":"Bonomi F, Mitzenmacher M, Panigrapy R, et al. Beyond Bloom filters: from approximate membership checks to approximate state machines. In: Proceedings of ACM SIGCOMM 2006. Pisa: ACM Press, 2006"},{"key":"4132_CR5","volume-title":"Proceedings of LISA 1999","author":"M. Roesch","year":"1999","unstructured":"Roesch M. Snort c lightweight intrusion detection for networks. In: Proceedings of LISA 1999. Seattle: USENIX Press, 1999"},{"key":"4132_CR6","doi-asserted-by":"crossref","first-page":"2435","DOI":"10.1016\/S1389-1286(99)00112-7","volume":"31","author":"V. Paxon","year":"1999","unstructured":"Paxon V. Bro: A system for detecting network intruders in real-time. Comput Networks, 1999, 31: 2435\u20132463","journal-title":"Comput Networks"},{"key":"4132_CR7","unstructured":"Levandoski J, Sommer E, Strait M. Application layer packet classifier for Linux. http:\/\/l7-filter.sourceforge.net , 2008"},{"key":"4132_CR8","volume-title":"Proceedings of www 2004","author":"S. Sen","year":"2004","unstructured":"Sen S, Spatscheck O, Wang D. Accurate, scalable in-network identification of P2P traffic using application signatures. In: Proceedings of www 2004. Manhattan: ACM Press, 2004"},{"key":"4132_CR9","volume-title":"Proceedings of IMC 2004","author":"T. Karagiannis","year":"2004","unstructured":"Karagiannis T, Broido A, Faloutsos M, et al. Transport layer identification of p2p traffic. In: Proceedings of IMC 2004. Taormina: ACM Press, 2004"},{"key":"4132_CR10","volume-title":"Proceedings of IEEE FCCM 2004","author":"C. R. Clark","year":"2004","unstructured":"Clark C R, Schimmel D E. Scalable pattern matching on high-speed networks. In: Proceedings of IEEE FCCM 2004. Napa: IEEE Press, 2004"},{"key":"4132_CR11","volume-title":"Proceedings of IEEE FCCM 2004","author":"I. Sourdis","year":"2004","unstructured":"Sourdis I, Pnevmatikatos D. Pre-decoded CAMs for efficient and high-speed NIDS pattern matching. In: Proceedings of IEEE FCCM 2004. Napa: IEEE Press, 2004"},{"key":"4132_CR12","volume-title":"Proceedings of IEEE ICNP 2004","author":"F. Yu","year":"2004","unstructured":"Yu F, Katz R, Lakshman T V. Gigabit rate packet pattern-matching using TCAM. In: Proceedings of IEEE ICNP 2004. Berlin: IEEE Press, 2004"},{"key":"4132_CR13","volume-title":"Proceedings of ACM\/IEEE ANCS 2006","author":"P. Piyachon","year":"2006","unstructured":"Piyachon P, Luo Y. Efficient memory utilization on network processors for deep packet inspection. In: Proceedings of ACM\/IEEE ANCS 2006. San Jose: ACM Press, 2006"},{"key":"4132_CR14","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/JSAC.2006.877221","volume":"34","author":"H. Lu","year":"2006","unstructured":"Lu H, Zheng K, Liu B, et al. A memory-efficient parallel string matching architecture for high-speed intrusion detection. IEEE J Select Areas Commun, 2006, 34: 1793\u20131804","journal-title":"IEEE J Select Areas Commun"},{"key":"4132_CR15","volume-title":"Proceedings of IEEE INFOCOM 2007","author":"N. S. Artan","year":"2007","unstructured":"Artan N S, Chao H J. TriBiCa: trie bitmap content analyzer for high-speed network intrusion detection. In: Proceedings of IEEE INFOCOM 2007. Anchorage: IEEE Press, 2007"},{"key":"4132_CR16","volume-title":"Proceedings of ACM SIGCOMM 2005","author":"H. Song","year":"2005","unstructured":"Song H, Dharmapurikar S, Turner J, et al. Fast hash table lookup using extended Bloom filter: an aid to network processing. In: Proceedings of ACM SIGCOMM 2005. Philadelphia: ACM Press, 2005"},{"key":"4132_CR17","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan L, Cao P, Almeida J, et al. Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans Network, 2000, 8: 281\u2013293","journal-title":"IEEE\/ACM Trans Network"},{"key":"4132_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1132462.1132464","volume":"3","author":"L. Tan","year":"2006","unstructured":"Tan L, Brotherton B, Sherwood T. Bit-split string-matching engines for intrusion detection and prevention. ACM Trans Architect Code Opt, 2006, 3: 3\u201334","journal-title":"ACM Trans Architect Code Opt"},{"key":"4132_CR19","volume-title":"Proceedings of ISCA 2006","author":"B. C. Brodie","year":"2006","unstructured":"Brodie B C, Cytron R K, Taylor D E. A scalable architecture for high-throughput regular-expression pattern matching. In: Proceedings of ISCA 2006. Boston: IEEE Press, 2006"},{"key":"4132_CR20","volume-title":"Proceedings of IEEE INFOCOM 2006","author":"J. Lunteren","year":"2006","unstructured":"Lunteren J. High performance pattern-matching for intrusion detection. In: Proceedings of IEEE INFOCOM 2006. Barcelona: IEEE Press, 2006"},{"key":"4132_CR21","volume-title":"Proceedings of ACM\/IEEE ANCS 2006","author":"F. Yu","year":"2006","unstructured":"Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient regular expression matching for deep packet inspection. In: Proceedings of ACM\/IEEE ANCS 2006. San Jose: ACM Press, 2006"},{"key":"4132_CR22","volume-title":"Proceedings of IEEE INFOCOM 2004","author":"N. Tuck","year":"2004","unstructured":"Tuck N, Sherwood T, Calder B, et al. Deterministic memory-efficient string matching algorithms for intrusion detection. In: Proceedings of IEEE INFOCOM 2004. Hong Kong: IEEE Press, 2004"},{"key":"4132_CR23","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"Aho A V, Corasick M J. Efficient string matching: an aid to bibliographic search. Commun ACM, 1975, 18: 333\u2013340","journal-title":"Commun ACM"},{"key":"4132_CR24","volume-title":"Proceedings of ACM\/IEEE ANCS 2005","author":"S. Dharmapurikar","year":"2005","unstructured":"Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for content filtering. In: Proceedings of ACM\/IEEE ANCS 2005. Princeton: ACM Press, 2005"},{"key":"4132_CR25","volume-title":"Proceedings of IEEE INFOCOM 2009","author":"N. Hua","year":"2009","unstructured":"Hua N, Song H, Lakshman T V. Variable-stride multi-pattern matching for scalable deep packet inspection. In: Proceedings of IEEE INFOCOM 2009. Rio de Janeiro: IEEE Press, 2009"},{"key":"4132_CR26","volume-title":"Proceedings of IEEE INFOCOM 2008","author":"T. Song","year":"2008","unstructured":"Song T, Zhang W, Wang D, et al. A memory efficient multiple pattern matching architecture for network security. In: Proceedings of IEEE INFOCOM 2008. Phoenix: IEEE Press, 2008"},{"key":"4132_CR27","volume-title":"Proceedings of ACM SIGCOMM 2006","author":"S. Kumar","year":"2006","unstructured":"Kumar S, Dharmapurikar S, Yu F, et al. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proceedings of ACM SIGCOMM 2006. Pisa: ACM Press, 2006"},{"key":"4132_CR28","volume-title":"Proceedings of ACM\/IEEE ANCS 2006","author":"S. Kumar","year":"2006","unstructured":"Kumar S, Turner J, Williams J. Advanced algorithms for fast and scalable deep packet inspection. In: Proceedings of ACM\/IEEE ANCS 2006. San Jose: ACM Press, 2006"},{"key":"4132_CR29","volume-title":"Proceedings of IEEE INFOCOM 2007","author":"M. Becchi","year":"2007","unstructured":"Becchi M, Cadambi S. Memory-efficient regular expression search using state merging. In: Proceedings of IEEE INFOCOM 2007. Anchorage: IEEE Press, 2007"},{"key":"4132_CR30","volume-title":"Proceedings of IEEE Symposium on Security and Privacy 2008","author":"R. Smith","year":"2008","unstructured":"Smith R, Estan C, Jha S. XFA: Faster signature matching with extended automata. In: Proceedings of IEEE Symposium on Security and Privacy 2008. Oakland: IEEE Press, 2008"},{"key":"4132_CR31","volume-title":"Proceedings of ACM SIGCOMM 2008","author":"R. Smith","year":"2008","unstructured":"Smith R, Estan C, Jha S, et al. Deflating the big bang: fast and scalable deep packet inspection with extended finite automata. In: Proceedings of ACM SIGCOMM 2008. Seattle: ACM Press, 2008"},{"key":"4132_CR32","volume-title":"Proceedings of ACM\/IEEE ANCS 2007","author":"S. Kumar","year":"2007","unstructured":"Kumar S, Chandrasekaran B, Turner J, et al. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In: Proceedings of ACM\/IEEE ANCS 2007. Orlando: ACM Press, 2007"},{"key":"4132_CR33","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A. Broder","year":"2004","unstructured":"Broder A, Mitzenmacher M. Network applications of Bloom filters: A survey. Internet Math, 2004, 1: 485\u2013509","journal-title":"Internet Math"},{"key":"4132_CR34","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MM.2004.1268997","volume":"24","author":"S. Dharmapurikar","year":"2004","unstructured":"Dharmapurikar S, Krishnamurthy P, Sproull T S, et al. Deep packet inspection using parallel Bloom filters. IEEE Micro, 2004, 24: 52\u201361","journal-title":"IEEE Micro"},{"key":"4132_CR35","volume-title":"Proceedings of IEEE INFOCOM 2001","author":"A. Broder","year":"2001","unstructured":"Broder A, Mitzenmacher M. Using multiple hash functions to improve IP lookups. In: Proceedings of IEEE INFOCOM 2001. Anchorage: IEEE Press, 2001"},{"key":"4132_CR36","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TNET.2007.899058","volume":"16","author":"A. Kirsch","year":"2008","unstructured":"Kirsch A, Mitzenmacher M. Simple summaries for hashing with choices. IEEE\/ACM Trans Network, 2008, 16: 218\u2013231","journal-title":"IEEE\/ACM Trans Network"},{"key":"4132_CR37","volume-title":"Proceedings of ACM\/IEEE ANCS 2005","author":"S. Kumar","year":"2005","unstructured":"Kumar S, Crowley P. Segmented hash: an efficient hash table implementation for high performance networking subsystems. In: Proceedings of ACM\/IEEE ANCS 2005. Princeton: ACM Press, 2005"},{"key":"4132_CR38","volume-title":"Proceedings of IEEE INFOCOM 2008","author":"S. Kumar","year":"2008","unstructured":"Kumar S, Turner J, Crowley P. Peacock hashing: deterministic and updatable hashing for high performance networking. In: Proceedings of IEEE INFOCOM 2008. Phoenix: IEEE Press, 2008"},{"key":"4132_CR39","volume-title":"Proceedings of IEEE INFOCOM 2008","author":"A. Kirsch","year":"2008","unstructured":"Kirsch A, Mitzenmacher M. The power of one move: hashing schemes for hardware. In: Proceedings of IEEE INFOCOM 2008. Phoenix: IEEE Press, 2008"},{"key":"4132_CR40","volume-title":"Proceedings of IEEE INFOCOM 2008","author":"H. Yu","year":"2008","unstructured":"Yu H, Mahapatra R. A memory-efficient hashing by multi-predicate Bloom filters for packet classification. In: Proceedings of IEEE INFOCOM 2008. Phoenix: IEEE Press, 2008"},{"key":"4132_CR41","volume-title":"Proceedings of IEEE ICNP 2008","author":"N. Hua","year":"2008","unstructured":"Hua N, Lin B, Xu J. Rank-indexed hashing: a compact construction of Bloom filters and variants. In: Proceedings of IEEE ICNP 2008. Orlando: IEEE Press, 2008"},{"key":"4132_CR42","volume-title":"Network algorithms: an interdisciplinary approach to designing fast network devices","author":"G. Varghese","year":"2004","unstructured":"Varghese G. Network algorithms: an interdisciplinary approach to designing fast network devices. San Fransisco, CA: Morgan Kaufmann Publishers, 2004"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4132-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-010-4132-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-010-4132-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:36:08Z","timestamp":1559403368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-010-4132-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,23]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["4132"],"URL":"https:\/\/doi.org\/10.1007\/s11432-010-4132-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,23]]}}}