A delayed input DFA optimized algorithm of bounding default path


Jin Qu, Rongcai Zhao, Peng Liu, Zishuang Li National Digital Switching System Engineering and Technological Research Center Zhengzhou, Henan, China Qin Li Zheng Zhou Light Industry Vocational College, Zhengzhou, Henan, China


To improve the storage space of finite automata on regular expression matching, the paper researches the main idea of the delayed input DFA algorithm based on bounding default path, and analyses the algorithm problem when bounding small length default path. Then we propose optimized algorithm based on weight first principle and node first principle and assess them on the actual rule set, the results show that the optimized algorithm could effectively improve the compression ratio when the default path is bounded small.


Deterministic Finite Automaton (DFA); Deep Packet Inspection (DPI);Regular Expression; Default Path; Compression Algorithm


To explore the background and basis of the node document

Springer Journals Database

Total: 7 articles

  • [1] Application Layer Packet Classifier for Linux, http://l7- filter.sourceforge.net/,
  • [2] SNORT Network Intrusion Detection System, http://www.snort.org/,
  • [3] Bro Intrusion Detection System, http://www.bro-ids.org/,
  • [4] S. Kumar;S. Dharmapurikar;F. Yu et al, Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection, SIGCOMM 2006,


Similar documents

Documents that have the similar content to the node document

Springer Journals Database

Total: 34 articles