Ing. Jan Kořenek, Ph.D.

KAŠTIL Jan, KOŘENEK Jan a LENGÁL Ondřej. Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing. In: 12th EUROMICRO Conference on Digital System Design DSD 2009. Patras: IEEE Computer Society, 2009, s. 823-289. ISBN 978-0-7695-3782-5.
Jazyk publikace:čeština
Název publikace:Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Název (en):Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Strany:823-289
Sborník:12th EUROMICRO Conference on Digital System Design DSD 2009
Konference:12th EUROMICRO Conference on Digital System Design, DSD'2009
Místo vydání:Patras, GR
Rok:2009
ISBN:978-0-7695-3782-5
Vydavatel:IEEE Computer Society
Soubory: 
+Typ Jméno Název Vel. Poslední změna
icon3782a823.pdf226 KB2012-02-07 09:57:41
^ Vybrat vše
S vybranými:
Klíčová slova
Intrusion detection, regular expression, perfect hashing, hardware acceleration
Anotace
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
Abstrakt
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
BibTeX:
@INPROCEEDINGS{
   author = {Jan Ka{\v{s}}til and Jan Ko{\v{r}}enek and Ond{\v{r}}ej
	Leng{\'{a}}l},
   title = {Methodology for Fast Pattern Matching by Deterministic
	Finite Automaton with Perfect Hashing},
   pages = {823--289},
   booktitle = {12th EUROMICRO Conference on Digital System Design DSD 2009},
   year = {2009},
   location = {Patras, GR},
   publisher = {IEEE Computer Society},
   ISBN = {978-0-7695-3782-5},
   language = {czech},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.cs?id=9054}
}

Vaše IPv4 adresa: 54.80.10.56
Přepnout na IPv6 spojení

DNSSEC [dnssec]