Regular expression matching in reconfigurable hardware

Journal of Signal Processing Systems

Volumn 51, Issue 1, 2008, Pages 99-121

  Sourdis, Ioannis ^a   Bispo, João ^b   Cardoso, João M P ^c   Vassiliadis, Stamatis ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b INESC ID   (Portugal)

^c INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Network security; Pattern matching; Reconfigurable hardware; Regular expression

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FINITE AUTOMATA; INTRUSION DETECTION; OPTIMIZATION;

RECONFIGURABLE HARDWARE; REGULAR EXPRESSION;

PATTERN MATCHING;

EID: 43449132689     PISSN: 19398018     EISSN: 19398115     Source Type: Journal    
DOI: 10.1007/s11265-007-0131-0     Document Type: Article

References (42)

1. 1. S. Stephens J. Y. Chen M. G. Davidson S. Thomas B. M. Trute 2005 Oracle database 10 g: a platform for blast search and regular expression pattern matching in life sciences Nucleic Acids Res. 33 675 679 10.1093/nar/gki114 S. Stephens, J. Y. Chen, M. G. Davidson, S. Thomas, and B. M. Trute, “Oracle database 10 g: a platform for blast search and regular expression pattern matching in life sciences,” Nucleic Acids Res., vol. 33 (database-Issue), 2005, pp. 675–679.
2. 2. S. Ray M. Craven 2005 Learning statistical models for annotating proteins with function information using biomedical text BMC Bioinformatics 6 Suppl. 1 S:18 S. Ray and M. Craven, “Learning statistical models for annotating proteins with function information using biomedical text,” BMC Bioinformatics, vol. 6, Suppl. 1, 2005, p. S:18.
3. 3. J.-M. Champarnaud F. Coulon T. Paranthoen 2004 Compact and fast algorithms for safe regular expression search Int. J. Comput. Math. 81 4 383 401 1093.68595 10.1080/00207160310001650025 2170889 J.-M. Champarnaud, F. Coulon, and T. Paranthoen, “Compact and fast algorithms for safe regular expression search,” Int. J. Comput. Math., vol. 81, no. 4, 2004, pp. 383–401.
4. 4. 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. 2nd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS’06), ACM Press, 2006, pp. 93–102.
5. 5. S. Kumar S. Dharmapurikar F. Yu P. Crowley J. Turner 2006 Algorithms to accelerate multiple regular expressions matching for deep packet inspection Comput. Commun. Rev. 36 4 339 350 10.1145/1151659.1159952 S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, “Algorithms to accelerate multiple regular expressions matching for deep packet inspection,” Comput. Commun. Rev., vol. 36, no. 4, 2006, pp. 339–350.
6. 6. F. Yu, Z. Chen, Y. Diao, T. Lakshman, and R. H. Katz, “Fast and memory-efficient regular expression matching for deep packet inspection,” EECS Department, University of California, Berkeley, Tech. Rep. UCB/EECS-2006-76, May 22 2006. [Online]. Available: http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-76.html.
7. 7. S. Kumar, J. Turner, and J. Williams, “Advanced algorithms for fast and scalable deep packet inspection,” in Proc. of ACM/IEEE Symposium on Architecture for Networking and Sommunications Systems (ANCS’06), New York, ACM Press, 2006, pp. 81–92.
8. 8. S. Vassiliadis S. Wong G. N. Gaydadjiev K. Bertels G. Kuzmanov E. M. Panainte 2004 The Molen polymorphic processor IEEE Trans. Comput. 53 11 1363 1375 10.1109/TC.2004.104 S. Vassiliadis, S. Wong, G. N. Gaydadjiev, K. Bertels, G. Kuzmanov, and E. M. Panainte, “The Molen polymorphic processor,” in IEEE Trans. Comput., vol. 53, no. 11, 2004, pp. 1363–1375.
9. 9. K. Compton S. Hauck 2002 Reconfigurable computing: a survey of systems and software ACM Comput. Surv. 34 2 171 210 10.1145/508352.508353 K. Compton and S. Hauck, “Reconfigurable computing: a survey of systems and software,” ACM Comput. Surv., vol. 34, no. 2, 2002, pp. 171–210.
10. 10. G. Berry R. Sethi 1986 From regular expressions to deterministic automata Theor. Comput. Sci. 48 1 117 126 0626.68043 10.1016/0304-3975(86)90088-5 889664 G. Berry and R. Sethi, “From regular expressions to deterministic automata,” Theor. Comput. Sci., vol. 48, no. 1, 1986, pp. 117–126.
11. 11. J. E. Hopcroft and J. D. Ullman, “ Introduction to Automata Theory, Languages and Computation, 2nd ed. Addison-Wesley, 2001.
12. 12. R. W. Floyd J. D. Ullman 1982 The compilation of regular expressions into integrated circuits J. Assoc. Comput. Mach. 29 3 603 622 0485.68047 666770 R. W. Floyd and J. D. Ullman, “The compilation of regular expressions into integrated circuits,” J. Assoc. Comput. Mach., vol. 29, no. 3, 1982, pp. 603–622.
13. 13. A. Karlin, H. Trickey, and J. Ullman, “Experience with a regular expression compiler,” in Proc. of IEEE Conference on Computer Design/VLSI in Computers, 1983, pp. 656–665.
14. 14. R. Sidhu and V. K. Prasanna, “Fast regular expression matching using FPGAs,” in Proc. of 9th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’01), IEEE Computer Society Press, 2001, pp. 227–238.
15. 15. A. Mukhopadhyay 1979 Hardware algorithms for non-numeric computation IEEE Trans. Comput. C-28 6 384 394 10.1109/TC.1979.1675378 A. Mukhopadhyay, “Hardware algorithms for non-numeric computation,” IEEE Trans. Comput., vol. C-28, no. 6, 1979, pp. 384–394.
16. 16. PCRE—Perl Compatible Regular Expressions, http://www.pcre.org/.
17. 17. SNORT official web site, http://www.snort.org.
18. 18. Bleeding Edge Threats web site, http://www.bleedingthreats.net.
19. 19. I. Dubrawsky, “Firewall evolution—deep packet inspaction,” July 2003, http://www.securityfocus.com/infocus/1716.
20. 20. M. Fisk and G. Varghese, “An analysis of fast string matching applied to content-based forwarding and intrusion detection,” in Techical Report CS2001-0670, University of California, San Diego, 2002.
21. 21. B. L. Hutchings, R. Franklin, and D. Carver, “Assisting network intrusion detection with reconfigurable hardware,” in Proc. of 10th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’02), IEEE Computer Society Press, 2002, pp. 111–120.
22. 22. J. Moscola, J. Lockwood, R. P. Loui, and M. Pachos, “Implementation of a content-scanning module for an Internet firewall,” in Proc. of 11th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’03), IEEE Computer Society Press, 2003, pp. 31–38.
23. 23. C. R. Clark and D. E. Schimmel, “Scalable parallel pattern-matching on high-speed networks,” in Proc. of 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’04), IEEE Computer Society Press, 2004, pp. 249–257.
24. 24. I. Sourdis and D. Pnevmatikatos, “Pre-decoded CAMs for efficient and high-speed NIDS pattern matching,” in Proc. 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’04), IEEE Computer Society Press, 2004, pp. 258–267.
25. 25. I. Sourdis, D. Pnevmatikatos, S. Wong, and S. Vassiliadis, “A reconfigurable perfect-hashing scheme for packet inspection,” in Proc. of 15th Int’l Conference on Field Programmable Logic and Applications (FPL’05), Tampere, 2005, pp. 644–647.
26. 26. G. Papadopoulos and D. Pnevmatikatos, “Hashing + Memory = Low Cost, exact pattern matching,” in Proc. 15th Int’l Conference on Field Programmable Logic and Applications (FPL’05), Tampere, 2005, pp. 39–44.
27. 27. M. Roesch, “{S}nort—lightweight intrusion detection for networks,” in Proc. of 13th USENIX Conference on System Administration, Seattle, 1999, pp. 229–238.
28. 28. M. Rabin D. Scott 1959 Finite automata and their decision problems IBM J. Res. Develop. 3 2 114 125 103795 10.1147/rd.32.0114 M. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Develop., vol. 3, no. 2, 1959, pp. 114–125.
29. 29. R. McNaughton H. Yamada 1960 Regular expressions and state graphs for automata IEEE Trans. Electron. Comput. EC-9 1 39 47 10.1109/TEC.1960.5221603 R. McNaughton and H. Yamada, “Regular expressions and state graphs for automata,” IEEE Trans. Electron. Comput., vol. EC-9, no. 1, 1960, pp. 39–47.
30. 30. K. Thompson 1968 Regular expression search algorithm Commun. ACM 11 6 419 422 0164.46205 10.1145/363347.363387 K. Thompson, “Regular expression search algorithm,” Commun. ACM, vol. 11, no. 6, 1968, pp. 419–422.
31. 31. M. J. Foster 1989 Avoiding latch formation in regular expression recognizers IEEE Trans. Comput. 38 5 754 756 10.1109/12.24279 1541521 M. J. Foster, “Avoiding latch formation in regular expression recognizers,” IEEE Trans. Comput., vol. 38, no. 5, 1989, pp. 754–756.
32. 32. C. R. Clark and D. E. Schimmel, “Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns,” in Proc. 13th Int’l Conference on Field Programmable Logic and Applications (FPL’03), Lisbon, 2003, pp. 956–959.
33. 33. C.-H. Lin, C.-T. Huang, C.-P. Jiang, and S.-C. Chang, “Optimization of regular expression pattern matching circuits on FPGA,” in Proc. of Conference on Design, Automation and Test in Europe (DATE’06), Munich, 2006, pp. 12–17.
34. 34. J. Moscola, Y. H. Cho, and J. W. Lockwood, “A scalable hybrid regular expression pattern matcher,” in Proc. of 14th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’06), IEEE Computer Society Press, 2006, pp. 337–338.
35. 35. Z. K. Baker and V. K. Prasanna, “A methodology for synthesis of efficient intrusion detection systems on FPGAs,” in Proc. 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’04), IEEE Computer Society Press, 2004, pp. 135–144.
36. 36. Z. K. Baker, H.-J. Jung, and V. K. Prasanna, “Regular expression software deceleration for intrusion detection systems,” in Proc. 16th Int’l Conference on Field Programmable Logic and Applications (FPL’06), Madrid, 2006, pp. 418–425.
37. 37. B. C. Brodie, D. E. Taylor, and R. K. Cytron, “A scalable architecture for high-throughput regular-expression pattern matching,” Comput. Archit. News, vol. 34, no. 2, 2006, pp. 191–202 [also published in 33rd Int’l Symposium on Computer Architecture (ISCA’06) ].
38. 38. P. Sutton, “Partial character decoding for improved regular expression matching in FPGAs,” in Proc. of IEEE Int’l Conference on Field-Programmable Technology (FPT’04), Brisbane, 2004, pp. 25–32.
39. 39. I. Sourdis, V. Dimopoulos, D. Pnevmatikatos, and S. Vassiliadis, “Packet pre-filtering for network intrusion detection,” in Proc. 2nd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS’06), San Jose, 2006, pp. 183–192.
40. 40. I. Sourdis and D. Pnevmatikatos, “Fast, large-scale string match for a 10 Gbps FPGA-based network intrusion detection system,” in Proc. of 13th Int’l Conference on Field Programmable Logic and Applications (FPL’03), Lisbon, 2003, pp. 880–889.
41. 41. T. Sproull, G. Brebner, and C. Neely, “Mutable codesign for embedded protocol processing,” in Proc. of 15th Int’l Conference on Field Programmable Logic and Applications (FPL’05), Tampere, 2005, pp. 51–56.
42. 42. J. C. Bispo, I. Sourdis, J. M.P. Cardoso, and S. Vassiliadis, “Regular expression matching for reconfigurable packet inspection,” in Proc. IEEE Int’l Conference on Field Programmable Technology (FPT’06), Bangkok, 2006, pp. 119–126.