Affiliation:
1. New Horizon College of Engineering, India
2. Rajalakshmi Engineering College, India
3. PES University, India
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.
Reference16 articles.
1. A Hybrid Finite Automaton for Practical Deep Packet Inspection.;M.Becchi;Proceedings of the ACM Conference on Emerging Networking Experiments and Technologies,2007
2. An Improved Algorithm to Accelerate Regular Expression Evaluation.;M.Becchi;Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems,2007
3. Extending Finite Automata to Efficiently Match Perl-Compatible Regular Expressions.;M.Becchi;Proceedings of the ACM International Conference on Emerging Networking Experiments and Technologies,2008
4. Differential Encoding of DFAs for Fast Regular Expression Matching.;D.Ficara;IEEE/ACM Transactions on Networking,2011
5. An Improved DFA for Fast Regular Expression Matching.;D.Ficara;Proceedings of the ACM SIGCOMM Computer Communication Review,2008