Skip to main content

Static Patterns Matching for High Speed Networks

  • Conference paper
Book cover Information Computing and Applications (ICICA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7473))

Included in the following conference series:

  • 4773 Accesses

Abstract

In response to the need of a large number of static pattern matching on high-speed network, this paper presents a FPGA-based hardware implementation of static pattern matching, which can process in parallel by using the matrix-and algorithm. This method can not only reduce the complexity of programming but also provide the basic of reconfigurable implementation. Experimental results show that the realization is able to reach the theoretical bandwidth multiplying clock frequency by input data width.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. SNORT Network Intrusion Detection System, www.snort.org

  2. Floyd, R.W., Ullman, J.D.: The Compilation of Regular Expressions into Integrated Circuits. Journal of ACM 29(3), 603–622 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Sidhu, R., Prasanna, V.K.: Fast Regular Expression Matching Using FPGAs. In: Field-Programmable Custom Computing Machines (FCCM 2001), pp. 227–238 (2001)

    Google Scholar 

  4. Hutchings, B.L., Franklin, R., Carver, D.: Assisting Network Intrusion Detection with Reconfigurable Hardware. In: 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2002), p. 111 (2002)

    Google Scholar 

  5. Clark, C.R., Schimmel, D.E.: Scalable Pattern Matching for High Speed Networks. In: Field-Programmable Custom Computing Machines (FCCM 2004), pp. 249–257 (2004)

    Google Scholar 

  6. Gokhale, M., Dubois, D., Dubois, A., Boorman, M., Poole, S., Hogsett, V.: Granidt: Towards Gigabit Rate Network Intrusion Detection Technology. In: Glesner, M., Zipf, P., Renovell, M. (eds.) FPL 2002. LNCS, vol. 2438, pp. 404–413. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Sourdis, I., Pnevmatikatos, D.: Fast, Large-Scale String Match for a 10 Gbps FPGA-based Network Intrusion Detection System. In: Y. K. Cheung, P., Constantinides, G.A. (eds.) FPL 2003. LNCS, vol. 2778, pp. 195–207. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Yu, F., Katz, R.H., Lakshman, T.V.: Gigabit rate packet patternmatching using TCAM. In: Proc. 12th IEEE Int. Conf. Netw. Protocols (ICNP), pp. 174–183 (2004)

    Google Scholar 

  9. Dharmapurikar, S., Krishnamurthy, P., Sproull, T., Lockwood, J.: Deep packet inspection using parallel bloom filters. In: Proc. 11th Symp. High Perform. Interconnects, pp. 44–53 (August 2003)

    Google Scholar 

  10. Lockwood, J.W., Moscola, J., Kulig, M., Reddick, D., Brooks, T.: Internet worm and virus protection in dynamically reconfigurable hardware. Presented at the Military Aerosp. Program. Logic Device (MAPLD), Washington, DC, p. E10 (September 2003)

    Google Scholar 

  11. Cho, Y.H., Navab, S., Mangione-Smith, W.H.: Specialized Hardware for Deep Network Packet Filtering. In: Glesner, M., Zipf, P., Renovell, M. (eds.) FPL 2002. LNCS, vol. 2438, pp. 452–461. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Moscola, J., Lockwood, J., Loui, R.P., Pachos, M.: Implementation of a Content-Scanning Module for an Internet Firewall. In: Proceedings of IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM), pp. 31–38 (2003)

    Google Scholar 

  13. Hwang, W.J., Ou, C.M., Shih, Y.N., Lo, C.T.D.: High throughput and low area cost FPGA-based signature match circuit for network Intrusion detection. Journal of the Chinese Institute of Engineers 32, 397–405 (2009)

    Article  Google Scholar 

  14. Chang, Y.-K., Chang, C.-R., Su, C.-C.: The Cost Effective Pre-processing Based NFA Pattern Matching Architecture for NIDS. In: Proceedings of the 2010 (2010)

    Google Scholar 

  15. Long, L.H., Hieu, T.T., Tai, V.T., Hung, N.H., Thinh, T.N., Vu, D.D.A.: Eceb: Enhanced constraint repetition block for regular expression matching on FPGA. ectithailandorg, pp. 65–74 (2010)

    Google Scholar 

  16. Chasaki, D., Wolf, T.: Fast regular expression matching in hardware using NFA-BDD combination. In: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2010, pp. 12:1–12:2. ACM, New York (2010)

    Google Scholar 

  17. Nakahara, H., Sasao, T., Matsuura, M.: A regular expression matching circuit based on a modular non-deterministic finite automaton with multi-character transition. In: The 16th Workshop on Synthesis and System Integration of Mixed Information Technologies, Ballroom, pp. 359–364 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, K., Guo, H., Zhu, S., Lan, J. (2012). Static Patterns Matching for High Speed Networks. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34062-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34061-1

  • Online ISBN: 978-3-642-34062-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics