| 对模式匹配算法的存储优化研究 |
| |
| 引用本文： | 林南晖,张国军. 对模式匹配算法的存储优化研究[J]. 中国海洋大学学报(自然科学版), 2008, 0(Z1) |
| |
| 作者姓名： | 林南晖 张国军 |
| |
| 作者单位： | [1]华南师范大学网络中心 [2]计算机学院 |
| |
| 摘 要： | 基于确定性有限自动机(DFA)的多模式匹配算法被广泛用于数据包深度检测系统中。它功能虽然强大,但是对内存的需求也比较大,因此很多算法提出了对它的优化方法,以减少对内存的需求量。本文通过用动态默认转移来替代DFA的failto转移,将DFA中大部分的failto转移删掉,从而达到优化DFA的目的。而且本算法易于用硬件实现,因此在对速度有要求的场合,可以通过专门的硬件来计算默认转移,这样默认转移的计算并不会对检测产生延迟,从而加快匹配速度。
|
| 关 键 词： | 入侵检测 动态默认转移 确定性有限自动机 |
Study of the Memory Optimization for Pattern Matching Algorithm |
| |
| LIN Nan-Hui,ZHANG Guo-Jun. Study of the Memory Optimization for Pattern Matching Algorithm[J]. Periodical of Ocean University of China, 2008, 0(Z1) |
| |
| Authors: | LIN Nan-Hui ZHANG Guo-Jun |
| |
| Affiliation: | LIN Nan-Hui,ZHANG Guo-Jun (Network Center,South China Normal University,Guangzhou 510631,China) |
| |
| Abstract: | The multi-pattern algorithm based on Deterministic Finite Automata(DFA) is commonly used in deep packet inspection systems.It is powerful,but it also needs a great deal of memory,so many algorithms have been proposed to optimize its memory requirement.In this study,the proposed algorithm used a dynamic default transition to replace the failto transitions,so eliminated most failto transitions of the DFA and achieved the memory optimization purpose.The proposed algorithm is also easy to achieve by hardware,if... |
| |
| Keywords: | intrusion detection dynamic default transition DFA |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
