Memory-efficient regular expression search using state merging

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1064-1072

  Becchi, Michela ^a   Cadambi, Srihari ^b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FINITE AUTOMATA; INTRUSION DETECTION; NETWORK MANAGEMENT; SEARCH ENGINES; TELECOMMUNICATION SERVICES;

NETWORK SERVICES; POLICY MANAGEMENT; REGULAR EXPRESSION; STATE MERGING;

PATTERN MATCHING;

EID: 34548322723     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.128     Document Type: Conference Paper

References (18)

1. M. Roesch, "Snort: Lightweight Intrusion Detection for Networks," in 13th System Administration Conference, pp. 229-238, Nov 1999.
2. "A System for Detecting Network Intruders in Real Time (http://www.icir.org/vern/bro-info.html).".
3. R. Sommer and V. Paxson, "Enhancing Byte-Level Network Intrusion Detection Signatures with Context," in ACM Conference on Computer and Communication Security, pp. 262-271, 2003.
4. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Automata Theory, Languages and Compilation. Addison Wesley, 3rd ed., 2004.
5. V. Paxson, "Fast Lexical Analyzer Generator (http://ftp.ee.lbl.gov/ flex-2.5.4.tar.gz),"
6. S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, "Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection," in ACM Sigcomm, Sept 2006.
7. N. Tuck, T. Sherwood, B. Calder, and G. Varghese, "Deterministic Memory-Efficient String Matching Algorithms for Intrusion Detection," in IEEE Infocom, pp. 333-340, Mar 2004.
8. R. S. Boyer and J. S. Moore, "A Fast String Searching Algorithm," Communications of the ACM, pp. 762-772, 1977.
9. S. Wu and U. Manber, "A fast algorithm for multi-pattern searching," Tech. Rep. TR-94-17, 1994.
10. A. V. Aho and M. J. Corasick, "Efficient String Matching: An Aid to Bibliographic Search," Communications of the ACM, pp. 333-340, 1975.
11. L. Tan and T. Sherwood, "A High Throughput String Matching Architecture for Intrusion Detection and Prevention," in ISCA, 2005.
12. F. Yu, R. H. Katz, and T. V. Lakshman, "Gigabit Rate Packet Pattern-Matching Using TCAM," in ICNP, pp. 174-183, 2004.
13. F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz, "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection."
14. B. C. Brodie, R. K. Cytron, and D. E. Taylor, "A Scalable Architecture for High-Throughput Regular-Expression Pattern Matching," in ISCA, pp. 191-202, 2006.
15. T. V. Lakshman and D. Stidialis, "High Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching," in ACM Sigcomm, Sept 1998.
16. F. Baboescu and G. Varghese, "Scalable Packet Classification," IEEE/ACM Transactions on Networking, pp. 2-14, Feb 2005.
17. G. Varghese, Network Algorthmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann, 1st ed., 2004.
18. S. Kumar, J. Turner, and J. Williams, "Advanced algorithms for fast and scalable deep packet inspection," in IEEE/ACM ANCS, Dec 2006.