Conference paper

KAŠTIL Jan and KOŘENEK Jan. High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table. In: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. La Jolla: Association for Computing Machinery, 2010, p. 2. ISBN 978-1-4503-0379-8.
Publication language:english
Original title:High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table
Title (cs):Algoritmus pro vysokorychlostní vyhledávání vzorů založený na Deterministickém konečném automatu s chybující přechodovou tabulkou
Pages:2
Proceedings:Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Conference:ACM/IEEE Symposium on Architectures for Networking and Communications Systems 2010
Place:La Jolla, US
Year:2010
ISBN:978-1-4503-0379-8
Publisher:Association for Computing Machinery
URL: [PDF]
Files: 
+Type Name Title Size Last modified
icon05623846.pdf98,3 KB2012-02-07 09:56:46
^ Select all
With selected:
Keywords
Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing

Annotation
Regular expression matching is the time-critical opera-
tion of many modern intrusion detection systems (IDS).
This paper proposes pattern matching algorithm to
match regular expression against multigigabit data
stream. As usually used regular expressions are only
subjectively tested and often generates many false po-
sitives/negatives, proposed algorithm support the pos-
sibility to reduce memory requirements by introducing
small amount of faults into the pattern matching. Al-
gorithm is based on the perfect hashing and is suitable
for hardware implementation.

Abstract
Regular expression matching is the time-critical opera-
tion of many modern intrusion detection systems (IDS).
This paper proposes pattern matching algorithm to
match regular expression against multigigabit data
stream. As usually used regular expressions are only
subjectively tested and often generates many false po-
sitives/negatives, proposed algorithm support the pos-
sibility to reduce memory requirements by introducing
small amount of faults into the pattern matching. Al-
gorithm is based on the perfect hashing and is suitable
for hardware implementation.

BibTeX:
@INPROCEEDINGS{
   author = {Jan Ka{\v{s}}til and Jan Ko{\v{r}}enek},
   title = {High Speed Pattern Matching Algorithm Based on Deterministic
	Finite Automata with Faulty Transition Table},
   pages = {2},
   booktitle = {Proceedings of the 6th ACM/IEEE Symposium on Architectures
	for Networking and Communications Systems},
   year = {2010},
   location = {La Jolla, US},
   publisher = {Association for Computing Machinery},
   ISBN = {978-1-4503-0379-8},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=9380}
}

Your IPv4 address: 54.226.132.197
Switch to IPv6 connection

DNSSEC [dnssec]