期刊文献+

一种无匹配时间损耗的DFA压缩算法的研究与实现 被引量:1

Research and Implementation of a DFA Compression Algorithm with No Matching Time Loss
下载PDF
导出
摘要 高性能深度包检测系统使用确定型有穷自动机DFA(Deterministic Finite Automata)来执行数据包的检测过程.然而,DFA所带来的存储消耗问题使其难以适用于片内资源稀缺的FPGA.目前已存在多种算法着眼于解决DFA的空间爆炸问题,但是其在带来较好压缩率的同时,也在一定程度上影响到了系统的检测速度.本文提出了一种无匹配时间损耗的DFA压缩算法,并在此基础上,基于FPGA硬件平台,设计实现了单个DFA匹配引擎.实验测试结果表明,本文所设计的算法,在未影响整个系统匹配性能的前提下,可以实现10%~30%左右的压缩率. Start-of-the-art deep packet inspection system uses deterministic finite automata(DFA)algorithms to perform regular expression matching.Nevertheless,the storage consumption problem caused by DFA make it difficult to apply to FPGA with scarce on-chip resources.At present,there are many algorithms aiming at solving the space explosion problem of DFA,but it affects the detection speed of the system to some extent while bringing better compression ratio.In this paper,a DFA compression algorithm without matching time loss is proposed.Based on the hardware platform of FPGA,a single DFA matching engine is designed and implemented.Experimental results show that the algorithm can achieve a compression rate of 10%to 30%without affecting the matching performance of the whole system.
作者 孙明乾 乔庐峰 陈庆华 SUN Ming-qian;QIAO Lu-feng;CHEN Qing-hua(Institute of Communication Engineering,Army Engineering University of PLA,Nanjing,Jiangsu 210000,China)
出处 《电子学报》 EI CAS CSCD 北大核心 2020年第6期1132-1139,共8页 Acta Electronica Sinica
关键词 深度包检测 DFA 存储压缩 FPGA deep packet inspection DFA storage compression FPGA
  • 相关文献

参考文献2

二级参考文献14

  • 1Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient reg- ular expression matching for deep packet inspection[ A ]. Proc of the IEEE/ACM Symp on Architectures for Networ- king and Communications Systems I C ]. IEEE, 2006. 93 102. 被引量:1
  • 2Hopcroft J E. Introduction to Automata Theory, Languages, and Computation[ M]. Pearson Addison Wesley ,2007. 被引量:1
  • 3Becchi M, Crowley P. A hybrid finite automaton for practi- cal deep packet inspection [ A ]. Proceedings of the 2007 ACM CoNEXT Conference [ C] . ACM,2007.1. 被引量:1
  • 4Kumar S, Dharmapurikar S, Yu F, et al. Algorithms to ac- celerate multiple regular expressions matching for deep packet inspection [ J ]. ACM SIGCOMM Computer Com- munication Review,2006,36 (4) 339 - 350. 被引量:1
  • 5Ficara D, Giordano S, Procissi G, et al. An improved DFA for fast regular expression matching [ J ]. ACM SIGCOMM Computer Communication Review, 2008,38 (5) :29 - 40. 被引量:1
  • 6Liu T, Yang Y, Liu Y, et al. An efficient regular expres- sions compression algorithm from a new perspective[ A ]. Proceedings of IEEE INFOCOM 2001 I C ]. IEEE, 2011. 2129 -2137. 被引量:1
  • 7Smith R, Estan C, Jha S, et al. Deflating the big bang : fast and scalable deep packet inspection with extended finite automata [ J ]. ACM SIGCOMM Computer Communica- tion Review, 2008,38 ( 4 ) : 207 - 218. 被引量:1
  • 8Liu C, Pan Y, Chen A, et al. A DFA with extended char- acter-set for fast deep packet inspection [J]. IEEE Trans- actions on Computers ,2014,63 ( 8 ) : 1527 - 1937. 被引量:1
  • 9Regular Expression Processor [EB/OL]. http://regex. wustl, edu/index, php/Main _ Page, 2014. 被引量:1
  • 10徐乾,鄂跃鹏,葛敬国,钱华林.深度包检测中一种高效的正则表达式压缩算法[J].软件学报,2009,20(8):2214-2226. 被引量:29

共引文献23

同被引文献9

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部