{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:02:56Z","timestamp":1725541376628},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108433"},{"type":"electronic","value":"9783642108440"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10844-0_19","type":"book-chapter","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T01:19:27Z","timestamp":1259543967000},"page":"149-156","source":"Crossref","is-referenced-by-count":0,"title":["Module-Based Finite Automata: A Scalable and Memory-Efficient Architecture for Multi-pattern Matching in Deep Packet Inspection"],"prefix":"10.1007","author":[{"given":"Junchen","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible PatternMatching in Strings-Practical On-Line Search Algorithms for Texts and Biological Sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible PatternMatching in Strings-Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge Univ. Press, Cambridge (2002)"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Coit, C.J., Staniford, S., McAlerney, J.: Towards faster string matching for intrusion detection or exceeding the speed of snort. In: Proc. DARPA Information Survivability Conf. Exposition (DISCEX II 2001), pp. 367\u2013373 (2001)","DOI":"10.1109\/DISCEX.2001.932231"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Fisk, M., Varghese, G.: Fast content-based packet handling for intrusion detection. UCSD, UCSD Tech. Rep. CS2001\u20130670 (2001)","DOI":"10.21236\/ADA406413"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Anagnostakis, K.G., Markatos, E.P., Antonatos, S., Polychronakis, M.: E2XB: A domain-specific string matching algorithm for intrusion detection. In: presented at the 18th IFIP Int. Information Security Conf., Athens, Greece (2003)","DOI":"10.1007\/978-0-387-35691-4_19"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1015047.1015055","volume":"3","author":"R.T. Liu","year":"2004","unstructured":"Liu, R.T., Huang, N.F., Chen, C.H., Kao, C.N.: A fast string-match algorithm for network processor-based network intrusion detection system. ACM Trans. Embedded Comput. Syst.\u00a03, 614\u2013633 (2004)","journal-title":"ACM Trans. Embedded Comput. Syst."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","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\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-09510-1_10","volume-title":"Automata, Languages, and Programming","author":"B.C. Walter","year":"1979","unstructured":"Walter, B.C.: A string matching algorithm fast on the average. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 118\u2013132. Springer, Heidelberg (1979)"},{"key":"19_CR8","unstructured":"Snort (2009), http:\/\/www.snort.org\/"},{"key":"19_CR9","unstructured":"ClamAV, http:\/\/www.clamav.net\/"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Song, T., Zhang, W., Wang, D., Xue, Y.: A memory efficient multiple pattern matching architecture for network security. In: IEEE INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2008.42"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lu, H., Zheng, K., Liu, B., Zhang, X., Liu, Y.: A memory-efficient parallel string matching architecture for high-speed intrusion detection. IEEE JSAC\u00a024(10) (2006)","DOI":"10.1109\/JSAC.2006.877221"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Dharmapurikar, S., Lockwood, J.W.: Fast and scalable pattern matching for network intrusion detection systems. IEEE JSAC\u00a024(10) (2006)","DOI":"10.1109\/JSAC.2006.877131"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"van Lunteren, J.: High-performance pattern-matching for intrusion detection. In: IEEE INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.204"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Tan, L., Sherwood, T.: A high throughput string matching architecture for intrusion detection and prevention. In: ISCA (2005)","DOI":"10.1145\/1080695.1069981"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Fang, Y., Katz, R.H., Lakshman, T.V.: Gigabit rate packet pattern matching using tcam. In: IEEE ICNP (2004)","DOI":"10.1109\/ICNP.2004.1348108"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Hua, N., Song, H., Lakshman, T.V.: Variable-Stride Multi-Pattern Matching For Scalable Deep Packet Inspection. In: IEEE INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5061946"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Brodie, B.C., Taylor, D.E., Cytron, R.K.: A scalable architecture for high-throughput regular-expression pattern matching. In: ISCA (2006)","DOI":"10.1109\/ISCA.2006.7"}],"container-title":["Communications in Computer and Information Science","Communication and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10844-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:35:48Z","timestamp":1606167348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10844-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108433","9783642108440"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10844-0_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}