Detail publikace

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Originální název

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Anglický název

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Jazyk

en

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.

Anglický 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.

BibTex


@inproceedings{BUT30724,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching",
  annote="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.",
  address="Technical University Wien",
  booktitle="Proceedings of Junior Scientist Conference 2008",
  chapter="30724",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Technical University Wien",
  year="2008",
  month="november",
  pages="103--104",
  publisher="Technical University Wien",
  type="conference paper"
}