Table of Contents Author Guidelines Submit a Manuscript
International Journal of Reconfigurable Computing
Volume 2009, Article ID 301512, 10 pages
http://dx.doi.org/10.1155/2009/301512
Research Article

Software Toolchain for Large-Scale RE-NFA Construction on FPGA

Department of Electrical Engineering, University of Southern California, Los Angeles, CA 90089-0911, USA

Received 15 March 2009; Accepted 19 June 2009

Academic Editor: Lionel Torres

Copyright © 2009 Yi-Hua E. Yang and Viktor K. Prasanna. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Becchi and P. Crowley, “A hybrid finite automaton for practical deep packet inspection,” in Proceedings of the 3rd International Conference on Emerging Networking EXperiments and Technologies (CoNEXT '07), pp. 1–12, New York, NY, USA, December 2007. View at Publisher · View at Google Scholar
  2. J. Bispo, I. Sourdis, J. M. P. Cardoso, and S. Vassiliadis, “Regular expression matching for reconfigurable packet inspection,” in Proceedings of the IEEE International Conference on Field Programmable Technology (FPT '06), pp. 119–126, Bangkok, Thailand, December 2006. View at Publisher · View at Google Scholar
  3. B. C. Brodle, R. K. Cytron, and D. E. Taylor, “A scalable architecture for high-throughput regular-expression pattern matching,” in Proceedings of the 33rd International Symposium on Computer Architecture (ISCA '06), pp. 191–202, Boston, Mass, USA, June 2006. View at Publisher · View at Google Scholar
  4. B. L. Hutchings, R. Franklin, and D. Carver, “Assisting network intrusion detection with reconfigurable hardware,” in Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '02), pp. 1–111, 2002.
  5. S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, “Algorithms to accelerate multiple regular expressions matching for deep packet inspection,” ACM SIGCOMM Computer Communication Review, vol. 36, no. 4, pp. 339–350, 2006. View at Publisher · View at Google Scholar
  6. S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese, “Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia,” in Proceedings of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems (ANCS '07), pp. 155–164, 2007.
  7. A. Mitra, W. Najjar, and L. Bhuyan, “Compiling PCRE to FPGA for accelerating SNORT IDS,” in Proceedings of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems (ANCS '07), pp. 127–136, New York, NY, USA, 2007.
  8. R. Sidhu and V. K. Prasanna, “Fast regular expression matching using FPGAs,” in Proceedings of the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 227–238, 2001.
  9. N. Yamagaki, R. Sidhu, and S. Kamiya, “High-speed regular expression matching engine using multi-character NFA,” in Proceedings of the International Conference on Field-Programmable Logic and Applications (FPL '08), pp. 131–136, August 2008. View at Publisher · View at Google Scholar
  10. Y.-H. E. Yang, W. Jiang, and V. K. Prasanna, “Compact architecture for high-throughput regular expression matching on FPGA,” in Proceedings of the ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '08), November 2008.
  11. 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 Proceedings of the 2nd ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS '06), pp. 93–102, San Jose, Calif, USA, December 2006. View at Publisher · View at Google Scholar
  12. C.-H. Lin, C.-T. Huang, C.-P. Jiang, and S.-C. Chang, “Optimization of regular expression pattern matching circuits on FPGA,” in Proceedings of the Conference on Design, Automation and Test in Europe (DATE '06), vol. 2, pp. 12–17, European Design and Automation Association, Leuven, Belgium, 2006.
  13. M. Becchi and P. Crowley, “An improved algorithm to accelerate regular expression evaluation,” in Proceedings of the ACM/IEEE Symposium on Architecture for Networking and Communications Systems (ANCS '07), pp. 145–154, 2007.
  14. R. Smith, C. Estan, S. Jha, and S. Kong, “Deflating the big bang: fast and scalable deep packet inspection with extended finite automata,” in Proceedings of the ACM SIGCOMM Conference on Data Communication (SIGCOMM '08), pp. 207–218, Seattle, Wash, USA, August 2008. View at Publisher · View at Google Scholar
  15. R. W. Floyd and J. D. Ullman, “The compilation of regular expressions into integrated circuits,” Journal of the ACM, vol. 29, no. 3, pp. 603–622, 1982. View at Publisher · View at Google Scholar
  16. C. R. Clark and D. E. Schimmel, “Scalable pattern matching for high speed networks,” in Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '04), pp. 249–257, Napa, Calif, USA, April 2004.
  17. “PCRE: Perl Compatible Regular Expression,” http://www.pcre.org.
  18. “Snort network instrusion detection,” http://www.snort.org.