By Topic

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jan Kastil ; CESNET z.s.p.o., Prague, Czech Republic ; Jan Korenek ; Ondrej Lengal

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.

Published in:

Digital System Design, Architectures, Methods and Tools, 2009. DSD '09. 12th Euromicro Conference on

Date of Conference:

27-29 Aug. 2009