Hardware implementation for scalable lookahead Regular Expression detection

Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and often limits the detection speed as well as the total number of RegExes that can be detected using limited resources. The two classical detection methods, Deterministic Finite Automaton (DFA) and Non-Deterministic Finite Automaton (NFA), have the potential problems of prohibitively large memory requirements and a large number of concurrent operations, respectively. Although recent schemes addressing these problems to improve DFA and NFA are promising, they are inherently limited by their scalability, since they follow the state transition model in DFA and NFA, where the state transitions occur per each character of the input. We recently proposed a scalable RegEx detection system called Lookahead Finite Automata (LaFA) to

• Type: Journal
• Year: 2010
• Where: IPPS
• Authors: Masanori Bando, N. Sertac Artan, Nishit Mehta, Yi Guan, H. Jonathan Chao
• Keywords: Detection, Distributed And Parallel Computing, Finite Automaton, IPPS 2010, State Transitions