Detail publikace

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

KAŠTIL, J. KOŘENEK, J.

Originální název

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Typ

článek ve sborníku mimo WoS a Scopus

Jazyk

angličtina

Originální abstrakt

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.

Klíčová slova

Deterministic Finite Automata, FPGA, perfect hashing

Autoři

KAŠTIL, J.; KOŘENEK, J.

Rok RIV

2008

Vydáno

18. 11. 2008

Nakladatel

Technical University Wien

Místo

Vienna

ISBN

978-3-200-01612-5

Kniha

Proceedings of Junior Scientist Conference 2008

Strany od

103

Strany do

104

Strany počet

2

BibTex

@inproceedings{BUT30724,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching",
  booktitle="Proceedings of Junior Scientist Conference 2008",
  year="2008",
  pages="103--104",
  publisher="Technical University Wien",
  address="Vienna",
  isbn="978-3-200-01612-5"
}