首页> 外文会议>International symposium on applied reconfigurable computing >FPGA-Based Memory Efficient Shift-And Algorithm for Regular Expression Matching
【24h】

FPGA-Based Memory Efficient Shift-And Algorithm for Regular Expression Matching

机译:基于FPGA的正则表达式匹配内存有效移位和算法

获取原文

摘要

This paper proposes a FPGA-based reconfigurable regular expression matching engine for a network intrusion detection system (NIDS). In the proposed system, the Shift-And algorithm was used to process a regular expression matching. To improve the memory efficiency of the algorithm especially used for the Non-deterministic Finite Automata (NFA) with large number of states, this paper proposes a parallel matching module with a counter module and a priority encoder. In addition, in the proposed system, a large NFA can be divided into several NFAs and process separately by parallel matching module. The proposed architecture with 265 regular expression matching modules is implemented using Xilinx Zynq-7030 FPGA, that shows 1.066 Gbps throughput and uses 54.81% LUT.
机译:本文提出了一种用于网络入侵检测系统(NIDS)的,基于FPGA的可重配置正则表达式匹配引擎。在提出的系统中,使用Shift-And算法来处理正则表达式匹配。为了提高特别适用于具有大量状态的不确定性有限自动机(NFA)的算法的存储效率,本文提出了一种具有计数器模块和优先级编码器的并行匹配模块。另外,在所提出的系统中,大的NFA可以分为几个NFA,并由并行匹配模块分别处理。使用Xilinx Zynq-7030 FPGA实现了具有265个正则表达式匹配模块的拟议架构,该架构显示出1.066 Gbps的吞吐量,并使用了54.81%的LUT。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号