| 基于正则表达式的深度包检测算法 |
| |
| 引用本文： | 丁晶陈晓岚吴萍. 基于正则表达式的深度包检测算法[J]. 计算机应用, 2007, 27(9): 2184-2186 |
| |
| 作者姓名： | 丁晶陈晓岚吴萍 |
| |
| 作者单位： | 华东师范大学 计算中心 |
| |
| 摘 要： | 在深入分析了DFA状态数对算法性能影响的基础上，提出了一种新的基于正则表达式的深度包检测算法，该算法保证在任意有限的系统资源下算法的时间复杂度空间复杂度最小。在Linux下实现了该算法，并对基于L7-filter模式集合的网络数据包进行了大量检测实验。结果表明，与已有的正则表达式算法比较，该算法的时间复杂度和空降复杂度最小。
|
| 关 键 词： | 深度包检测 模式匹配 正则表达式 确定性有限自动机 |
| 文章编号： | 1001-9081(2007)09-2184-03 |
| 收稿时间： | 2007-03-16 |
| 修稿时间： | 2007-03-16 |
Deep packet inspection algorithm based on regular expressions |
| |
| DING Jing,CHEN Xiao-lan,WU Ping. Deep packet inspection algorithm based on regular expressions[J]. Journal of Computer Applications, 2007, 27(9): 2184-2186 |
| |
| Authors: | DING Jing CHEN Xiao-lan WU Ping |
| |
| Abstract: | 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. |
| |
| Keywords: | deep packet inspection pattern matching regular expressions Deterministic Finite Automation(DFA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
