期刊文献+

基于FPGA的XFA约束重复检测匹配

Constraint repetition inspection for XFA on FPGA
下载PDF
导出
摘要 针对目前正则表达式匹配中约束重复问题所带来的空间消耗爆炸以及失配等问题,基于FPGA设计了一种硬件约束重复检测匹配模块,该模块与基于并联ROM的XFA匹配模块相结合,可以快速实现约束重复的检测和匹配。通过定义约束重复参数存储器,计数模块仅消耗少量的硬件资源即可实现约束重复的检测匹配。实验中计数模块可实现Gbps的吞吐量,同时使正则表示式规则存储空间压缩50%以上。 Aiming at the space explosion and mismatching problems posed by complex constraint repetitions in regular expression.This paper designs a FPGA- based hardware constraint repetition inspection block. Combining with the interleaved ROM block, this block can quickly achieve constraint repetition detection and matching. By defining constraint- repetition- parameter- memory, the counting block consumes only a small amount of hardware resources to achieve constrained duplicate detection matches. Experimen-tal results for module that the counting block can reach Gbps throughput and the regular expression rule storage space compression by more than 50 %.
出处 《电子技术应用》 北大核心 2016年第9期47-50,54,共5页 Application of Electronic Technique
基金 国家自然科学基金项目(61402531) 陕西省自然科学基金项目(2014JQ8307 2015JQ6231)
关键词 约束重复 FPGA 并联ROM constraint repetition FPGA interleaved ROM
  • 相关文献

参考文献9

  • 1张树壮,罗浩,方滨兴,云晓春.一种面向网络安全检测的高性能正则表达式匹配算法[J].计算机学报,2010,33(10):1976-1986. 被引量:27
  • 2Snort 2.9.7.3.2016.http ://www. snort, org.
  • 3DIEN N K,HIEU T T,THINH T N.Memory-based multi- pattern signature scanning for clamAV antivirus[M].Future Data and Security Engineering.Springer International Publishing, 2014 : 58-70.
  • 4KUMAR S,DHARMAPURIKAR S,YU F,et al.Algorithms to accelerate multiple regular expressions matching for deep packet inspection[C].Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications.New York:ACM Press,2006 339-350.
  • 5BECCHI M,ROWL C E P.A hybrid finite automaton for practical deep packet inspection.Proceedings of the ACM CoNEXT.New York, 2007: 1-12.
  • 6魏德志,洪联系,林丽娜,吴旭.一种改进的XFA在深度包检测中的应用[J].计算机工程与应用,2012,48(34):245-248. 被引量:1
  • 7张树壮,罗浩,方滨兴.面向网络安全的正则表达式匹配技术[J].软件学报,2011,22(8):1838-1854. 被引量:29
  • 8AEZIPOUR M, NOURANI M.Constraint repetition inspection for regular expression on FPGA[C].Proc.of the 2008 16th IEEE Symp.on High Performance Interconnects.Washington 2008.111-118.
  • 9LONG H L,HIEU T T,TAI V T,et al.ECEB :enhanced constraint repetition block for regular expression matching on FPGA[J].ECTI Transactions on Electrical Engineering,Electronics, and Communications, 2011,9 : 65-74.

二级参考文献27

  • 1Yu Fang, Chen Zhifeng, Diao Yanlei et al. Fast and memory-efficient regular expression matching for deep packet in spection//Proceedings of the IEEE/ACM ANCS. San Jose California, 2006:93-102.
  • 2Kumar S, Dharmapurikar S, Yu F et al. Algorithms to accelerate multiple regular expressions matching for deep pack et inspection//Proceedings of the ACM SIGCOMM. Pisa, Italy, 2006:339-350.
  • 3Becchi M, Cadambi S. Memory-efficient regular expression search using state merging/ /Proceedings of the IEEE Infocom. Anchorage, Alaska, 2007:1064-1072.
  • 4Kumar S, Chandrasekaran G, Turner Jet al. Curing regular expressions matching from insomnia, amnesia and acalculia// Proceedings of the 3rd ACM/IEEE Symposium on Architecture for Networking and Communications Systems. Orlando, Florida, USA, 2007. 155-164.
  • 5Becchi M, Crowley P. A hybrid finite automaton for practical deep packet inspection//Proceedings of the ACM CoNEXT. New York, 2007:1-12.
  • 6Smith Randy, Estan Cristian, Jha Somesh et al. Fast signature matching using extended finite automaton(XFA)//Proceedings of the ICISS Hyderabad. India, 2008. 158 -172.
  • 7Kong Shijin, Smith Randy, Estan Cristian. Efficient signature matching with multiple alphabet compression tables// Proceedings of the 4th International Conference on Security and Privacy in Communication Netowrks. Istanbul, Turkey, 2008.- 1-10.
  • 8Ficara D, Giordano S, Procissi G et al. An improved DFA for fast regular expression matching. ACM SIGCOMM Computer Communication Review, 2008, 38(5) : 29-40.
  • 9Kumar S, Turner J, Williams J. Advanced algorithms for fast and scalable deep packet inspection//Proceedings of the IEEE/ACM ANCS. San Jose, California, 2006. 81-92.
  • 10Becchi M, Cadambi S. An improved algorithm to accelerate regular expression evaluation//Proceedings of the IEEE/ ACM ANCS. Orlando, Florida, 2007:145-154.

共引文献53

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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