摘要
在深入分析了DFA状态数对算法性能影响的基础上,提出了一种新的基于正则表达式的深度包检测算法,该算法保证在任意有限的系统资源下算法的时间复杂度空间复杂度最小。在Linux下实现了该算法,并对基于L7-filter模式集合的网络数据包进行了大量检测实验。结果表明,与已有的正则表达式算法比较,该算法的时间复杂度和空降复杂度最小。
This paper proposed a new DFA-based pattern matching algorithm. Based on the analysis of the impact of the number of DFA states on the algorithm performance, further improvement to the algorithm was made by introducing a DFA state number optimization algorithm. The proposed algorithm has been implemented in Linux environment and lots of experiments have been done. Experimental results show that the performance of the proposed algorithm is much better than others.
出处
《计算机应用》
CSCD
北大核心
2007年第9期2184-2186,2193,共4页
journal of Computer Applications
关键词
深度包检测
模式匹配
正则表达式
确定性有限自动机
deep packet inspection
pattern matching
regular expressions
Deterministic Finite Automation（DFA）
