Conference paper

KOŘENEK Jan and KOŠAŘ Vlastimil. Efficient Mapping of Nondeterministic Automata to FPGA for Fast Regular Expression Matching. In: Proceedings of the 13th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems DDECS 2010. Vienna: IEEE Computer Society, 2010, p. 6. ISBN 978-1-4244-6610-8.
Publication language:english
Original title:Efficient Mapping of Nondeterministic Automata to FPGA for Fast Regular Expression Matching
Title (cs):Efektivní mapování nedeterministických automatů do FPGA pro rychlé hledání regulárních výrazů
Pages:6
Proceedings:Proceedings of the 13th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems DDECS 2010
Conference:IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems 2010
Place:Vienna, AT
Year:2010
ISBN:978-1-4244-6610-8
Publisher:IEEE Computer Society
Keywords
FPGA, regular expressions, automaton, transition table
Annotation
With the growing number of viruses and network attacks, Intrusion Detection Systems have to match a large set of regular expressions at multi-gigabit speed to detect malicious activities on the network. Many algorithms and architectures have been designed to accelerate pattern matching, but most of them can be used only for strings or a small set 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 at multi-gigabit speed. The proposed reduction uses model of nondeterministic and deterministic automaton for effective mapping of regular expressions to FPGA. A new algorithm is designed to split the nondeterministic automaton transition table in order to map a part of the table into memory. The algorithm can place more than 49\% of transition table to memory, which reduces the amount of look-up tables by more than 43\% and flip-flops by more than 38\% for all selected sets of regular expressions. Moreover, a sparse transition table is mapped to memory with overlapped rows, which enables to store the table in a highly compact form.
BibTeX:
@INPROCEEDINGS{
   author = {Jan Ko{\v{r}}enek and Vlastimil Ko{\v{s}}a{\v{r}}},
   title = {Efficient Mapping of Nondeterministic Automata to FPGA for
	Fast Regular Expression Matching},
   pages = {6},
   booktitle = {Proceedings of the 13th IEEE International Symposium on
	Design and Diagnostics of Electronic Circuits and Systems
	DDECS 2010},
   year = {2010},
   location = {Vienna, AT},
   publisher = {IEEE Computer Society},
   ISBN = {978-1-4244-6610-8},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9202}
}

Your IPv4 address: 54.144.57.183
Switch to IPv6 connection

DNSSEC [dnssec]