Deterministic finite automata characterization and optimization for scalable pattern matching

Abstract

Memory-based Deterministic Finite Automata (DFA) are ideal for pattern matching in network intrusion detection systems due to their deterministic performance and ease of update of new patterns, however severe DFA memory requirements make it impractical to implement thousands of patterns. This article aims to understand the basic relationship between DFA… (More)
DOI: 10.1145/1952998.1953002

33 Figures and Tables

Topics

  • Presentations referencing similar topics