Conference paper

KAŠTIL Jan and KOŘENEK Jan. Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching. In: Proceedings of Junior Scientist Conference 2008. Vienna: Technical University Wien, 2008, pp. 103-104. ISBN 978-3-200-01612-5.
Publication language:english
Original title:Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching
Title (cs):Deterministický konečný automat s perfektním hashováním pro rychlé vyhledávání vzorů
Pages:103-104
Proceedings:Proceedings of Junior Scientist Conference 2008
Conference:Junior Scientist Conference 2008
Place:Vienna, AT
Year:2008
ISBN:978-3-200-01612-5
Publisher:Technical University Wien
Keywords
Deterministic Finite Automata, FPGA, perfect hashing
Annotation
As todays networks grow very fast, it is necessary
to protect networks by security systems such as firewalls and
Intrusion Detection Systems. Pattern matching is time critical
operation on multigigabit networks for current IDS. Patterns
are often described by regular expressions. The paper deals
with fast regular expression matching using the Deterministic
Finite Automata (DFA) with perfect hash function. We introduce
decomposition of the statement to the transformation of
the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table.
BibTeX:
@INPROCEEDINGS{
   author = {Jan Ka{\v{s}}til and Jan Ko{\v{r}}enek},
   title = {Deterministic Finite Automaton with Perfect Hashing for Fast
	Pattern Matching},
   pages = {103--104},
   booktitle = {Proceedings of Junior Scientist Conference 2008},
   year = {2008},
   location = {Vienna, AT},
   publisher = {Technical University Wien},
   ISBN = {978-3-200-01612-5},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=8807}
}

Your IPv4 address: 54.224.49.217
Switch to IPv6 connection

DNSSEC [dnssec]