About: Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table
  • As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table (en)
  • As the speed of current computer networks increases,<br>it is necessary to protect networks by security systems<br>such as firewalls and Intrusion Detection Systems operating<br>at multigigabit speeds. Pattern matching is the time-critical<br>operation of current IDS on multigigabit networks. Regular<br>expressions are often used to describe malicious network patterns.<br>This paper deals with fast regular expression matching using<br>the Deterministic Finite Automaton (DFA) with perfect hash<br>function. We introduce decomposition of the problem on two<br>parts: transformation of the input alphabet and usage of a fast<br>DFA, and usage of perfect hashing to reduce space/speed tradeoff<br>for DFA transition table (cs)
Title
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing (en)
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing (cs)
skos:prefLabel
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing (en)
  • Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing (cs)
skos:notation
  • RIV/00216305:26230/09:PU82695!RIV10-MSM-26230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021630528), Z(MSM6383917201)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 325683
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/09:PU82695
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Intrusion detection, regular expression, perfect hashing, hardware acceleration<br> (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [D0C72BF1D89B]
http://linked.open...v/mistoKonaniAkce
  • Patras
http://linked.open...i/riv/mistoVydani
  • Patras
http://linked.open...i/riv/nazevZdroje
  • 12th EUROMICRO Conference on Digital System Design DSD 2009
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kaštil, Jan
  • Kořenek, Jan
  • Lengál, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society
https://schema.org/isbn
  • 978-0-7695-3782-5
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software