Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Wang, Jianhua (Faculty of Automation, Guangdong University of Technology) ;
  • Cheng, Lianglun (Faculty of Automation, Guangdong University of Technology) ;
  • Liu, Jun (Faculty of Automation, Guangdong University of Technology)
  • Received : 2013.04.24
  • Accepted : 2014.03.10
  • Published : 2014.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. K. Heyse, K. Bruneel, and D. Stroobandt, "Proving correct-ness of regular expression matchers with constrained repetition," Electronics Letters, vol. 49, no. 1, pp. 41-42, 2013. https://doi.org/10.1049/el.2012.2208
  2. X. Wang, Y. Xu, O. Ormond, B. Liu, and X. Wang, "StriFA: stride finite automata for high-speed regular expression matching in network intrusion detection systems," IEEE Systems Journal, vol. 7, no. 3, pp. 374-384, 2013. https://doi.org/10.1109/JSYST.2013.2244791
  3. S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, "Algorithms to accelerate multiple regular expressions matching for deep packet inspection," ACM SIGCOMM Computer Communication Review, vol. 36, no. 4, pp. 339-350, 2006. https://doi.org/10.1145/1151659.1159952
  4. M. Becchi and S Cadambi, "Memory-efficient regular expression search using state merging," in Proceedings of the 26th IEEE International Conference on Computer Communications, Anchorage, AK, 2007, pp. 1064-1072.
  5. B. C. Brodie, D. E. Taylor, and R. K. Cytron, "A scalable architecture for high-throughput regular-expression pattern matching," in Proceeding of the 33rd International Symposium on Computer Architecture, Boston, MA, 2006, pp. 192-202.
  6. D. Ficara, G. Antichi, A. Di Pietro, S. Giordano, G. Procissi, and F. Vitucci, "Sampling techniques to accelerate pattern matching in network intrusion detection systems," in Proceeding of the IEEE International Conference on Communications, Cape Town, 2010, pp. 1-5.
  7. S. Kumar, J. Turner, and J. Williams, "Advanced algorithms for fast and scalable deep packet inspection," in Proceedings of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems, San Jose, CA, 2006, pp. 81-92.
  8. F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz, "Fast and memory-efficient regular expression matching for deep packet inspection," in Proceeding of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems, San Jose, CA, 2006, pp. 93-102.
  9. S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese, "Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia," in Proceedings of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems, Orlando, FL, 2007, pp. 155-164.
  10. H. Wang, S. Pu, G. Knezek, and J. C. Liu, "Min-max: a counter-based algorithm for regular expression matching," IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 1, pp. 92-103, 2013. https://doi.org/10.1109/TPDS.2012.116
  11. R. Smith, C. Estan, S. Jha, and S. Kong, "Deflating the big bang: fast and scalable deep packet inspection with extended finite automata," in Proceedings of the ACM SIGCOMM 2008 Conference on Applications, Technologies, Architectures, and Protocol for Computer Communications, Seattle, WA, 2008, pp. 207-218.
  12. R. Smith, C. Estan, and S. Jha, "XFA: faster signature matching with extended automata," in Proceeding of the IEEE Symposium on Security and Privacy, Oakland, CA, 2008, pp. 187-201.
  13. K. Peng, Q. Dong, and M. Chen, "TCAM-based DFA deflation: a novel approach to fast and scalable regular expression matching," in Proceedings of the IEEE 19th International Workshop on Quality of Service, San Jose, CA, 2011, pp. 1-3.