Skip to main content
SpringerLink
Log in

Efficient Regular Expression Pattern Matching on Graphics Processing Units

  • Conference paper
Contemporary Computing (IC3 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 168))

Included in the following conference series:

  • 1172 Accesses

Abstract

Regular expression signature matching has been used increasingly in network security applications like intrusion detection systems, virus scanners, network forensics, spam filters etc. However, signature matching causes decrease in performance on the host when load increases due to the large requirements in terms of memory and processing power. This is mainly because every byte and possibly a combination of bytes of the input have to be matched against a large set of regular expressions. Modern Graphics Processing Units (GPUs) are capable of high performance computing and recently are being used for general purpose computing. The large performance throughput and data parallelism of these modern GPUs is used to perform matching on the input data in parallel. Experimental results show that our GPU implementation is up to 12 times faster than the traditional CPU implementation while being up to 4 times faster than the GPU implementation using texture memory.

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

Access this chapter

Log in via an institution
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, http://www.snort.org

  2. Paxson, V.: Bro: A system for detecting network intruders in real-time. In: Proceedings of the 7th conference on USENIX Security Symposium (SSYM 1998), pp. 3–3. USENIX Association, Berkeley (1998)

    Google Scholar 

  3. Sommer, R., Paxson, V.: Enhancing byte-level network intrusion detection signatures with context. In: Proceedings of the 10th ACM conference on Computer and communications security (CCS 2003), pp. 262–271. ACM Press, New York (2003)

    Chapter  Google Scholar 

  4. Antonatos, S., Anagnostakis, K.G., Markatos, E.P.: Generating realistic workloads for network intrusion detection systems. ACM SIGSOFT Software Engineering Notes 29, 207–215 (2004)

    Article  Google Scholar 

  5. Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic memory-efficient string matching algorithms for intrusion detection. In: Proc. of INFOCOM, vol. 4, pp. 2628–2639 (2004)

    Google Scholar 

  6. Clark, C.R., Schimmel, D.E.: Scalable Pattern Matching for High Speed Networks. In: Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 249–257. IEEE Computer Society, Washington (2004)

    Chapter  Google Scholar 

  7. Tan, L., Sherwood, T.: A High Throughput String Matching Architecture for Intrusion Detection and Prevention. In: Proceedings of the 32nd annual international symposium on Computer Architecture, vol. 4, pp. 112–122 (2005)

    Google Scholar 

  8. Yu, F., Katz, R.H., Lakshman, T.V.: Gigabit rate packet pattern-matching using TCAM. In: Proceedings of the 12th IEEE International Conference on Network Protocols, pp. 174–183 (2004)

    Google Scholar 

  9. Vasiliadis, G., Antonatos, S., Polychronakis, M., Markatos, E.P., Ioannidis, S.: Regular Expression Matching on Graphics Hardware for Intrusion Detection. In: Proceedings of the 12th International Symposium on Recent Advances in Intrusion Detection (RAID), pp. 265 – 283 (2009)

    Google Scholar 

  10. Jacob, N., Brodley, C.: Offloading IDS computation to the GPU. In: Proceedings of the 22nd Annual Computer Security Applications Conference on Annual Computer Security Applications Conference (ACSAC 2006), pp. 371–380. IEEE Computer Society, Los Alamitos (2006)

    Chapter  Google Scholar 

  11. Marziale, L., Richard, G.G., Roussev, V.: Massive threading: Using GPUs to increase the performance of digital forensics tools. Digital Investigation 4, 73–81 (2007)

    Article  Google Scholar 

  12. Vasiliadis, G., Antonatos, S., Polychronakis, M., Markatos, E.P., Ioannidis, S.: Gnort: High performance network intrusion detection using graphics processors. In: Lippmann, R., Kirda, E., Trachtenberg, A. (eds.) RAID 2008. LNCS, vol. 5230, pp. 116–134. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Finite Automata in Introduction to Automata Theory Languages and Computation, pp. 46–47. Pearson Eduaction, Delhi

    Google Scholar 

  14. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Finite Automata in Introduction to Automata Theory Languages and Computation, pp. 56–57. Pearson Eduaction, Delhi

    Google Scholar 

  15. Thompson, K.: Programming techniques: Regular expression search algorithm. Commun. ACM, 419–422 (1968)

    Google Scholar 

  16. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor.Comput. Sci. 48(1), 117–126 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  17. NVIDIA CUDA Compute Unified Device Architecture Programming Guide, version 3.1 3.1.pdf, http://developer.download.nvidia.com/compute/cuda/3_1/NVIDIA_CUDA_Programming_Guide_

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Computer Engineering, Indian Institute of Techology Roorkee, Roorkee, India

    Sudheer Ponnemkunnath & R. C. Joshi

Authors
  1. Sudheer Ponnemkunnath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. C. Joshi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Iowa State University and IIT Bombay, India, 329 Durham, Ames, IA 5001, Iowa, USA

    Srinivas Aluru

  2. Indian Statistical Institute, 203 B.T. Road, 700 108, Kolkata, West Bengal, India

    Sanghamitra Bandyopadhyay

  3. The Ohio State University, 3190 Graves Hall, 333 W 10th Ave, 43210, Columbus, OH, USA

    Umit V. Catalyurek

  4. Department of Computing Science, Chalmers University, Rännvagen 6B, 412 96, Göteborg, Sweden

    Devdatt P. Dubhashi

  5. Dept. of Electrical and Computer Engineering, Iowa State University, 329 Durham, IA 50011, Ames, USA

    Phillip H. Jones

  6. TASSL, Dept. of Electrical & Computer Engineering, Rutgers, The State University of New Jersey, Brett Road, NJ 08854-8058, Piscataway, USA

    Manish Parashar

  7. School of Computer Engineering, Nanyang Technological University, N4-02a-32 Nanyang Ave, 639798, Singapore

    Bertil Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ponnemkunnath, S., Joshi, R.C. (2011). Efficient Regular Expression Pattern Matching on Graphics Processing Units. In: Aluru, S., et al. Contemporary Computing. IC3 2011. Communications in Computer and Information Science, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22606-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22606-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22605-2

  • Online ISBN: 978-3-642-22606-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation