ABSTRACT
Regular expression matching has been playing an import role in today's network security systems with deep inspection function. However, compiling a set of regular expressions into one Deterministic Finite Automata (DFA) often leads to state explosion, which means huge or even impractical memory cost. Distributing regular expressions into several groups and building DFAs independently has been proved an efficient solution, but the previous grouping algorithms are either locally optimal or time-consuming. In this work, we proposed a new grouping method based on Spectral Clustering, which defines the similarity between regular expressions and then transforms grouping problem to clustering problem. Preliminary experiments illustrate that our grouping algorithm achieves efficient result with much less processing time.
- F. Yu, Z. Chen, Y. Diao, T. V. Lakshman and R. H. Katz. Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection. Proc. of ACM/IEEE ANCS, 2006. Google ScholarDigital Library
- J. Rohrer, K. Atasu, J. V. Lunteren and C. Hagleitne. Memory-Efficient Distribution of Regular Expressions for Fast Deep Packet Inspection. Proc. of the 7th IEEE/ACM international conference on hardware/software codesign and system synthesis, 2009. Google ScholarDigital Library
- R. Antonello, S. Fernandes, A. Santos, et al. Efficient DFA grouping for traffic identification. Proc. of Global Communications Conference (GLOBECOM), 2012.Google ScholarCross Ref
- Z. Fu, K. Wang, L. Cai and J. Li. Intelligent Grouping Algorithms for Regular Expressions in Deep Inspection. Proc. of the 23rd International Conference on Computer Communications and Networks (ICCCN), 2014.Google ScholarCross Ref
- Regular Expression Processor, http://regex.wustl.edu/.Google Scholar
- Snort, http://www.snort.org/.Google Scholar
- L7-filter, http://l7-filter.clearfoundation.com/.Google Scholar
Index Terms
- Spectral clustering based regular expression grouping
Recommendations
Intelligent and efficient grouping algorithms for large-scale regular expressions
AbstractRegular expressions are widely used in various applications. Due to its low time complexity and stable performance, Deterministic Finite Automaton (DFA) has become the first choice to perform fast regular expression matching. Unfortunately, ...
ParaRegex: Towards Fast Regular Expression Matching in Parallel
ANCS '16: Proceedings of the 2016 Symposium on Architectures for Networking and Communications SystemsIn this paper, we propose ParaRegex, a novel approach for fast parallel regular expression matching. ParaRegex is a framework that implements data-parallel regular expression matching for deterministic finite automaton based methods. Experimental ...
Chain-Based DFA Deflation for Fast and Scalable Regular Expression Matching Using TCAM
ANCS '11: Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications SystemsRegular expression matching is the core engine of many network functions such as intrusion detection, protocol analysis and so on. In spite of intensive research, we are still in need of a method for fast and scalable regular expression matching, where ...
Comments