A Memory-Based NFA Regular Expression Match Engine for Signature-Based Intrusion Detection

Download Now
Provided by: Reed Business Information
Topic: Security
Format: PDF
Signature-based intrusion detection is required to inspect network traffic at wire-speed. Matching packet payloads against patterns specified with regular expression is a computation intensive task. Hence, the design of hardware accelerator to speed up regular expression matching has been an active research area. A systematic approach to detect regular expression is based on finite automaton. The space-time tradeoff between Deterministic Finite Automaton (DFA) and Non-deterministic Finite Automaton (NFA) is well-known. DFA can offer constant throughput but it may suffer from the state explosion problem. Hence, implementation of DFA for large pattern sets on embedded device with limited on-chip memory may not be viable.
Download Now

Find By Topic