| 基于动态默认转移的深度包检测算法 |
| |
| 引用本文： | 张国军,林南晖. 基于动态默认转移的深度包检测算法[J]. 计算机工程, 2009, 35(9): 121-123 |
| |
| 作者姓名： | 张国军 林南晖 |
| |
| 作者单位： | 华南师范大学计算机学院,广州,510631;华南师范大学网络中心,广州,510631 |
| |
| 摘 要： | 由于基于确定性有限自动机（DFA）的多模式匹配算法对内存的需求比较大，因此需要对DFA进行优化，以减少其对内存的需求量。算法通过用动态默认转移来替代DFA的failto转移，将DFA中大量的failto转移删掉，从而达到优化DFA的目的。实验结果证明，该算法能有效地优化DFA对内存的需求。
|
| 关 键 词： | 入侵检测 动态默认转移 确定性有限自动机 |
| 修稿时间： | |
Deep Package Detection Algorithm Based on Dynamic Default Transition |
| |
| ZHANG Guo-jun,LIN Nan-hui. Deep Package Detection Algorithm Based on Dynamic Default Transition[J]. Computer Engineering, 2009, 35(9): 121-123 |
| |
| Authors: | ZHANG Guo-jun LIN Nan-hui |
| |
| Affiliation: | 1.School of Computer;South China Normal University;Guangzhou 510631;2.Network Center;Guangzhou 510631 |
| |
| Abstract: | The multi-pattern matching algorithm that based on Deterministic Finite Automata(DFA) needs a lot of memory.In order to reduce its memory requirement,the DFA is needed to optimize.This paper proposes a dynamic default transition algorithm to replace the failto transitions,eliminates most failto transitions of the DFA and achieves the memory optimization purpose.The experiment result shows the proposed algorithm can reduce the memory requirement of DFA effectively. |
| |
| Keywords: | intrusion detection dynamic default transition Deterministic Finite Automata(DFA) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
