Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F08%3APU78072" target="_blank" >RIV/00216305:26230/08:PU78072 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Original language description

As todays networks grow very fast, it is necessary<br>to protect networks by security systems such as firewalls and<br>Intrusion Detection Systems. Pattern matching is time critical<br>operation on multigigabit networks for current IDS. Patterns<br>are often described by regular expressions. The paper deals<br>with fast regular expression matching using the Deterministic<br>Finite Automata (DFA) with perfect hash function. We introduce<br>decomposition of the statement to the transformation of<br>the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table.

Czech name

Deterministický konečný automat s perfektním hashováním pro rychlé vyhledávání vzorů

Czech description

Článek prezentuje nový způsob implementace deterministických konečných automatů vhodný pro implementaci v FPGA.<br>

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2008

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of Junior Scientist Conference 2008

ISBN

978-3-200-01612-5

ISSN

—

e-ISSN

—

Number of pages

2

Pages from-to

—

Publisher name

Technical University Wien

Place of publication

Vienna

Event location

Vídeň

Event date

Nov 16, 2008

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—