Detail výsledku
Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity
KOŠAŘ, V.; KOŘENEK, J. Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity. IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011. Cottbus: IEEE Computer Society, 2011. p. 401-402. ISBN: 978-1-4244-9753-9.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Košař Vlastimil, Ing., Ph.D., FIT (FIT), UIFS (FIT), UPSY (FIT)
Kořenek Jan, doc. Ing., Ph.D., UPSY (FIT)
Kořenek Jan, doc. Ing., Ph.D., UPSY (FIT)
Abstrakt
Intrusion Detection Systems have to match large sets of regular expressions to detect malicious traffic on multi-gigabit networks. Many algorithms and architectures have been proposed to accelerate pattern matching, but formal methods for reduction of Nondeterministic finite automata have not been used yet. We propose to use reduction of automata by similarity to match larger set of regular expressions in FPGA. Proposed reduction is able to decrease the number of states by more than 32% and the amount of transitions by more than 31%. The amount of look-up tables is reduced by more than 15% and the amount of flip-flops by more than 34%.
Klíčová slova
FPGA, NFA, reduction, regular expression matching
Rok
2011
Strany
401–402
Sborník
IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011
Konference
IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems 2011
ISBN
978-1-4244-9753-9
Vydavatel
IEEE Computer Society
Místo
Cottbus
BibTeX
@inproceedings{BUT76456,
author="Vlastimil {Košař} and Jan {Kořenek}",
title="Reduction of FPGA Resources for Regular Expression Matching by Relation Similarity",
booktitle="IEEE Design and Diagnostics of Electronic Circuits and Systems DDECS'2011",
year="2011",
pages="401--402",
publisher="IEEE Computer Society",
address="Cottbus",
isbn="978-1-4244-9753-9",
url="https://www.fit.vut.cz/research/publication/9766/"
}
Soubory
Projekty
Výzkum informačních technologií z hlediska bezpečnosti, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, zahájení: 2007-01-01, ukončení: 2013-12-31, řešení
Výzkumné skupiny
Pracoviště
Ústav počítačových systémů
(UPSY)