Publication Details

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

KAŠTIL, J.; KOŘENEK, J. High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table. Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. La Jolla: Association for Computing Machinery, 2010. p. 1-2. ISBN: 978-1-4503-0379-8.
Czech title
Algoritmus pro vysokorychlostní vyhledávání vzorů založený na Deterministickém konečném automatu s chybující přechodovou tabulkou
Type
conference paper
Language
English
Authors
Kaštil Jan, Ing., Ph.D.
Kořenek Jan, doc. Ing., Ph.D. (DCSY)
Keywords

Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing

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.

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.

Published
2010
Pages
1–2
Proceedings
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
ISBN
978-1-4503-0379-8
Publisher
Association for Computing Machinery
Place
La Jolla
BibTeX 
@inproceedings{BUT34955,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table",
  booktitle="Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
  year="2010",
  pages="1--2",
  publisher="Association for Computing Machinery",
  address="La Jolla",
  isbn="978-1-4503-0379-8",
  url="https://www.fit.vut.cz/research/publication/9380/"
}
Back to top