A Regular Expression Matching Algorithm Based on High-Efficient Finite Automaton

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality. Category: Smart and intelligent computing

[1]  Karel Heyse,et al.  Proving correctness of regular expression matchers with constrained repetition , 2013 .

[2]  Jonathan S. Turner,et al.  Advanced algorithms for fast and scalable deep packet inspection , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[3]  Somesh Jha,et al.  Deflating the big bang: fast and scalable deep packet inspection with extended finite automata , 2008, SIGCOMM '08.

[4]  서정연,et al.  Journal of Computing Science and Engineering(JCSE)의 국제화 작업 , 2010 .

[5]  Patrick Crowley,et al.  Algorithms to accelerate multiple regular expressions matching for deep packet inspection , 2006, SIGCOMM.

[6]  George Varghese,et al.  Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia , 2007, ANCS '07.

[7]  Srihari Cadambi,et al.  Memory-Efficient Regular Expression Search Using State Merging , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Somesh Jha,et al.  XFA: Faster Signature Matching with Extended Automata , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[9]  Hao Wang,et al.  MIN-MAX: A Counter-Based Algorithm for Regular Expression Matching , 2013, IEEE Transactions on Parallel and Distributed Systems.

[10]  Ron K. Cytron,et al.  A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching , 2006, 33rd International Symposium on Computer Architecture (ISCA'06).

[11]  Min Chen,et al.  TCAM-based DFA deflation: A novel approach to fast and scalable regular expression matching , 2011, 2011 IEEE Nineteenth IEEE International Workshop on Quality of Service.

[12]  Stefano Giordano,et al.  Sampling Techniques to Accelerate Pattern Matching in Network Intrusion Detection Systems , 2010, 2010 IEEE International Conference on Communications.

[13]  Xiaofei Wang,et al.  StriFA: Stride Finite Automata for High-Speed Regular Expression Matching in Network Intrusion Detection Systems , 2013, IEEE Systems Journal.

[14]  T. V. Lakshman,et al.  Fast and memory-efficient regular expression matching for deep packet inspection , 2006, 2006 Symposium on Architecture For Networking And Communications Systems.

[15]  Yanli Hou,et al.  Automatic Segmentation of Retinal Blood Vessels Based on Improved Multiscale Line Detection , 2014, J. Comput. Sci. Eng..