首页> 中文期刊> 《计算机与数字工程》 >基于正则表达式的DFA拆分算法研究

基于正则表达式的DFA拆分算法研究

         

摘要

Traditional deep packet inspection exploited a simple string matching technology to match packets with a fixed string, regular expressions can provide greater expressive power and otter flexibility, but the number of states have multiplied greatly and led to huge stor-age host by complex structure of regular expressions. DFA split algorithm is proposed that DFA conversion tables should be spitted into three tables: an indirect index table, a conversion output table, a direct conversion table. Experiment results show that the DFA split algorithm greatly reduces the space occupied and realizes DFA compression store.%深度包检测采用简单的字符串匹配技术将报文内容与一组固定字符串进行匹配,基于正则表达式匹配算法能提供更强的表达能力和灵活性,而复杂的正则表达式结构可能引起DFA的状态数膨胀,导致存储代价巨大;DFA拆分算法将DFA转换表拆分为三个表:间接索引表,转换输出表,直接转换表,实验结果表明DFA所占空间大大减小,实现了DFA的压缩存储.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号