| 一种用于深度包检测的正则表达式分组算法 |
| |
| 引用本文： | 杜江,王希. 一种用于深度包检测的正则表达式分组算法[J]. 电脑与微电子技术, 2012, 0(12): 3-5,9 |
| |
| 作者姓名： | 杜江 王希 |
| |
| 作者单位： | [1]重庆邮电大学计算机科学与技术学院,重庆400065 [2]重庆邮电大学通信与信息工程学院．重庆400065,重庆400065 |
| |
| 摘 要： | 当前深度包检测算法通常需要将正则表达式转换为NFA或者DFA．但是随着网络带宽的不断增加．NFA和DFA状态占用的存储空间越来越大，极大地考验着系统的存储能力。为了应对这个问题．提出一种基于正则表达式相性的分组算法来对表达式进行分组，实验证明该算法能减少NFA和DFA状态的数量，提高匹配的效率。
|
| 关 键 词： | 深度包检测 正则表达式 NFA DFA 相性 |
A Regular Expression Grouping Algorithm for Deep Packet Inspection |
| |
| DU Jiang,WANG Xi. A Regular Expression Grouping Algorithm for Deep Packet Inspection[J]. , 2012, 0(12): 3-5,9 |
| |
| Authors: | DU Jiang WANG Xi |
| |
| Affiliation: | 1. Department of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065) (2.Department of Communication and Information Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065 ) |
| |
| Abstract: | The current Deep Packet Inspection （DPI） algorithm usually need to transform regular expres- sions into NFA or DFA. But with network bandwidth＇s increase, states of NFA and DFA take more and more memory space. It tests greatly system＇s memory capacity. In order to deal with this problem, puts forward a new concept： regular expression compatibility. And we divide regu- lar expressions into groups through a new grouping algorithm. The experiment shows it could re- duce the number of states of NFA and DFA and improve matching efficiency. |
| |
| Keywords: | DPI Regular Expression NFA DFA Compatibility |
| 本文献已被 维普 等数据库收录！ |
