Optimization of Regular Expression Processing Circuits for NIDS on FPGA

Hieu, Tran Trung; Thinh, Tran Ngoc; Vu, Tran; Tomiyama, Shigenori

doi:10.1109/icnc.2011.23

Cited by 8 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this paper does not handle these operators, just like other studies [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18].…”

Section: Regular Expressions (Res)mentioning

confidence: 99%

“…Table 2 shows that our proposed method requires at most 5.24 seconds for selecting templates. On the other hand, the existing pattern dependent approach [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12] requires more than 5 minutes due to re-design of a dedicated circuit for a pattern. Next, we describe the relation between the length (the number of characters) of a pattern and the computation time of selecting templates.…”

Section: Evaluation Of Pattern Updating Timementioning

confidence: 99%

“…Reference [3] has improved the area efficiency and performance by optimizing the conversion from RE to NFA and from the NFA to circuit. References [7], [8] have proposed some techniques to share common prefix, infix and suffix between REs to reduce the circuit size. Reference [4] has proposed a method to optimize a circuit for FPGA with 6 input LUTs.…”

Section: Related Workmentioning

confidence: 99%

“…Reference [2] has proposed a method to implement an NFA corresponding to a given pattern as a circuit on a reconfigurable device, such as an FPGA. References [3], [4], [5], [6], [7], [8], [9], [10], [11], [12] have proposed a method to improve this method. Reference [3] has improved the area efficiency and performance by optimizing the conversion from RE to NFA and from the NFA to circuit.…”

Section: Related Workmentioning

confidence: 99%

“…One is a pattern dependent approach [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]. The pattern dependent REM engines have a dedicated circuit structure for a given pattern.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Area Efficient Regular Expression Matching Engine Using Partial Reconfiguration for Quick Pattern Updating

Wakaba

Wakabayashi

Nagayama

et al. 2014

IPSJ Transactions on System LSI Design Methodology

View full text Add to dashboard Cite

This paper proposes a method using partial reconfiguration to realize a compact regular expression matching engine, which can update a pattern quickly. In the proposed method, a set of partial circuits, each of which handles a different class of regular expressions, are provided in advance. When a regular expression pattern is given, a compact matching engine dedicated to the pattern is implemented on FPGA by combining the partial circuits according to the given pattern using partial reconfiguration. The method can update a pattern quickly, since it does not need re-design of a circuit. Experimental results show that the proposed method reduces 60% circuit size compared with the previous method without increasing the pattern updating time significantly.

show abstract

“…However, this paper does not handle these operators, just like other studies [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18].…”

Section: Regular Expressions (Res)mentioning

confidence: 99%

Section: Evaluation Of Pattern Updating Timementioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

“…One is a pattern dependent approach [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]. The pattern dependent REM engines have a dedicated circuit structure for a given pattern.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations