[ACM Press the 3rd ACM/IEEE Symposium -
โ
Becchi, Michela; Crowley, Patrick
๐
Article
๐
2007
๐
ACM Press
โ 427 KB
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. While deterministic finite automata (DFAs) allow this operation to be performed in linear time, they may exhibit prohibitive