Efficient signature matching with multiple Alphabet Compression Tables

Proceedings of the 4th International Conference on Security and Privacy in Communication Networks, SecureComm'08

Volumn , Issue , 2008, Pages

  Kong, Shijin ^a   Smith, Randy ^a   Estan, Cristian ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Alphabet compression; Deep packet inspection; Regular expressions; Signature matching

Indexed keywords

ALPHABET COMPRESSION; COMPRESSION METHODS; COMPRESSION TECHNIQUES; CRITICAL OPERATIONS; DEEP PACKET INSPECTION; DETERMINISTIC FINITE AUTOMATA; INTRUSION PREVENTION; INTRUSION PREVENTION SYSTEMS; MEMORY REQUIREMENTS; MEMORY SAVINGS; REGULAR EXPRESSIONS; RUNTIMES; SIGNATURE MATCHING; SIGNATURE SETS; SINGLE PASS;

PACKET NETWORKS;

FINITE AUTOMATA;

EID: 70249112256     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1460877.1460879     Document Type: Conference Paper

References (22)

1. Alfred V. Aho and Margaret J. Corasick. Efficient string matching: An aid to bibliographic search. In Communications of the ACM, June 1975.
2. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986.
3. Michela Becchi and Srihari Cadambi. Memory-efficient regular expression search using state merging. In Proceedings of IEEE Infocom, Anchorage, AK, May 2007. ACM.
4. Michela Becchi and Patrick Crowley. An improved algorithm to accelerate regular expression evaluation. In Proceedings of the 2007 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Orlando, FL, December 2007. ACM.
5. Benjamin C. Brodie, Ron K. Cytron, and David E. Taylor. A scalable architecture for high-throughput regular-expression pattern matching. SIGARCH Comput. Archit. News, 34(2):191-202, 2006.
6. Richard M. Brualdi. Introductory Combinatorics, 2nd ed itio n. Prentice Hall, 1992.
7. David Brumley, James Newsome, Dawn Song, Hao Wang, and Somesh Jha. Towards automatic generation of vulnerability-based signatures. In IEEE Symposium on Security and Privacy, Oakland, California, May 2006.
8. Christopher R. Clark and David E. Schimmel. Scalable pattern matching for high-speed networks. In IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), pages 249-257, Napa, California, April 2004.
9. Beate Commentz-Walter. A string matching algorithm fast on the average. In Proc. 6th International Cooloquium on Automata, Languages, and Programming, pages 118-132, 1979.
10. Peter Dencker, Karl Durre, and Johannes Heuft. Optimization of parser tables for portable compilers. ACM Trans. Prog ram. Lan g. Syst., 6(4):546-572, 1984.
11. S.C. Johnson. Yacc - yet another compiler compiler. Computing Science Technical Report 32, AT&T Bell Laboratories, 1975.
12. Sailesh. Kumar, Balakrishnan. Chandrasekaran, Jonathan. Turner, and George Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In ANCS 2007, pages 155-164.
13. Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, and Jonathan Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In Proceedings of the ACM SIGCOMM, September 2006.
14. Sailesh Kumar, Jonathan Turner, and John Williams. Advanced algorithms for fast and scalable deep packet inspection. In ANCS '06: Proceedings of the 2006 ACM/IEEE symposium on Architectures for networking and communications systems, pages 81-92, New York, NY, USA, 2006. ACM Press.
15. Vern Paxson. The flex fast scanner generator, 1995. Available at http://flex.sourceforge.net/.
16. Reetinder Sidhu and Viktor Prasanna. Fast regular expression matching using FPGAs. In IEEE Symposium on Field-Programmable Custom Computing Machines, April 2001.
17. Randy Smith, Cristian Estan, and Somesh Jha. Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata. In SIGCOMM, August 2008.
18. Randy Smith, Cristian Estan, and Somesh Jha. XFA: Faster signature matching with extended automata. In IEEE Symposium on Security and Privacy, May 2008.
19. Robin Sommer and Vern Paxson. Enhancing byte-level network intrusion detection signatures with context. In ACM CCS, Washington, DC, Oct. 2003.
20. Ioannis Sourdis and Dionisios Pnevmatikatos. Pre-decoded CAMs for efficient and high-speed NIDS pattern matching. In FCCM, April 2004.
21. Sun Wu and Udi Manber. A fast algorithm for multi-pattern searching. TR 94-17, Department of Computer Science, University of Arizona, 1994.
22. Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman, and Randy H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In ANCS '06: Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems, pages 93-102, 2006.