Deterministic finite automata characterization for memory-based pattern matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5927 LNCS, Issue , 2009, Pages 268-282

  Vespa, Lucas ^a   Weng, Ning ^a  

^a Southern Illinois University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC FINITE AUTOMATA; HEURISTIC TECHNIQUES; INTERNET SECURITY; MEMORY REQUIREMENTS; MULTI-PATTERN MATCHING; NETWORK INTRUSION DETECTION SYSTEMS;

AUTOMATA THEORY; COMPUTER CRIME; HEURISTIC METHODS; INTRUSION DETECTION; PATTERN MATCHING; TRANSLATION (LANGUAGES);

NETWORK SECURITY;

EID: 76549094516     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11145-7_21     Document Type: Conference Paper

References (14)

1. Aho, A., Corasick, M.: Efficient string matching: An aid to bibliographic search. Communications of the ACM 18 (1975)
2. Brodie, B.C., Taylor, D.E., Cytron, R.K.: A scalable architecture for highthroughput regular-expression pattern matching. SIGARCH Comput. Archit. News 34(2), 191-202 (2006)
3. Roesch, M.: Snort - lightweight intrusion detection for networks. In: Proc. of the 13th Systems Administration Conference (1999)
4. Varghese, G.: Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices, 1st edn. Morgan Kaufmann, San Francisco (2005)
5. Bu, L., Chandy, J.A.: Fpga based network intrusion detection using content addressable memories. In: FCCM 2004: Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Washington, DC, USA, pp. 316-317 (2004)
6. Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic memory-efficient string matching algorithms for intrusion detection. In: Proc. of the IEEE Infocom Conference, pp. 333-340 (2004)
7. Yu, F., Chen, Z., Diao, Y., Lakshman, T., Katz, R.H.: Fast and memory-efficient regular expression matching for deep packet inspection. EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-76 (May 2006)
8. Fisk, M., Varghese, G.: Applying fast string matching to intrusion detection, los Alamos National Lab Report (2002)
9. Becchi, M., Crowley, P.: An improved algorithm to accelerate regular expression evaluation. In: Proc. of ANCS, pp. 145-154. ACM, Orlando (2007)
10. Kumar, S., Dharmapurikar, S., Yu, F., Crowley, P., Turner, J.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In: Proc. of ACM SIGCOMM, pp. 339-350. ACM, New York (2006)
11. van Lunteren, J.: High-performance pattern-matching for intrusion detection. In: INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1-13 (2006)
12. Smith, R., Estan, C., Jha, S., Kong, S.: Deflating the big bang: fast and scalable deep packet inspection with extended finite automata. In: SIGCOMM 2008: Proceedings of the ACM SIGCOMM 2008 conference on Data communication, New York, USA, pp. 207-218 (2008)
13. Snort Rule Database, Snort (2009), http://www.snort.org/pub-bin/ downloads.cgi
14. Soewito, B., et al.: Self addressable memory-based fsm (sam-fsm): A scalable intrusion detection engine. IEEE Network Special Issue on Recent Developments in Network Intrusion Detection 23(1), 14-21 (2009)