No abstract

No abstract

The vast majority of the system security application in today's systems depend on deep packet inspection. In recent years, regular expression matching has been used as an important operator that examines whether or not the packet's payload can be matched with a group of predefined regular expression. Regular expressions are parsed using the deterministic finite automata representations. Conversely, to represent regular expression sets as DFA, the system needs large amount of memory, an excessive amount of time, or an excessive amount of per flow state limiting their practical applications. In this chapter, the intelligent optimization grouping algorithms (IOGA) are discussed to resolve the state blow up problem. As a result of using IOGA, the system provides memory-efficient automata by dispensing the regular expression sets in various groups and optimizing the DFAs.

No abstract