Publication Details
NFA Split Architecture for Fast Regular Expression Matching
Regular expressions matching, Automaton, FPGA
Many hardware architectures have been designed to accelerate
regular expression matching in network security devices, but most of them can achieve high throughput only for strings or small sets of regular expressions. We propose new NFA Split architecture which reduces the amount of consumed FPGA resources in order to match larger set of regular expressions. New algorithm is introduced to find non-collision sets of states and determine part of nondeterministic automaton which can be mapped to the memory based architecture. For all analysed sets of regular expressions, the algorithm was able to find non-collision sets with 67.8 % of states in average and reduces the amount of consumed flip-flops to 37.6 % and look-up tables to 63.9 % in average.
@INPROCEEDINGS{FITPUB9390,
author = "Jan Ko\v{r}enek and Vlastimil Ko\v{s}a\v{r}",
title = "NFA Split Architecture for Fast Regular Expression Matching",
pages = 2,
booktitle = "Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
year = 2010,
location = "La Jolla, US",
publisher = "Association for Computing Machinery",
ISBN = "978-1-4503-0379-8",
language = "czech",
url = "https://www.fit.vut.cz/research/publication/9390"
}