Fast and compact regular expression matching using character substitution

Proceedings - 2011 7th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2011

Volumn , Issue , 2011, Pages 85-86

  Liu, Xingkui ^a   Liu, Xinchun ^b   Sun, Ninghui ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b Sugon Co Ltd   (China)

Author keywords

deep packet inspection; DFA; Regular expressions

Indexed keywords

DEEP PACKET INSPECTION; DFA; INTRUSION DETECTION SYSTEMS; MATCHING SPEED; MEMORY REQUIREMENTS; MEMORY USAGE; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING; RULE SET; TRANSITION TABLE;

INTRUSION DETECTION;

EID: 81255143459     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ANCS.2011.20     Document Type: Conference Paper

References (6)

1. F. Yu, Z. Chen, Y. Diao, T.V. Lakshman, and R. H. Katz, "Fast and memory-efficient regular expression matching for deep packet inspection", in Proc. ANCS, Dec 2006.
2. S. Kumar, S. Dharmapurikar, F. Yu, P.Crowley, and J. Turner, "Algorithms to accelerate multiple regular expressions matching for deep packet inspection", in Proc. ACM SIGCOMM, 2006.
3. M. Becchi and P. Crowley, "An improved algorithm to accelerate regular expression evaluation", In Proc. ANCS, 2007.
4. M. Becchi, and S. Cadambi, "Memory-efficient regular expression search using state merging", In Proc. INFOCOM, 2007.
5. S. Zhang, H. Luo, B. Fang, and X. Yun, "Fast and memoryefficient regular expression matching using transition sharing", In IEICE Trans. on Information and Systems. Vol.E92-D No.10, 2009.
6. S. Kong, S. Kong and C. Estan, "Efficient signature matching with multiple alphabet compression tables", in ACM SecureComm 2008, Sep 2008.