1 / 15

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications. Authors: Tsern-Huei Lee; Nai-Lun Huang Publisher: Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on 3-7 Aug. 2008 Page(s)1 - 7 Present: Chia-Ming ,Chang

cleo
Télécharger la présentation

An Efficient and Scalable Pattern Matching Scheme for Network Security Applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. An Efficient and Scalable Pattern Matching Scheme for Network Security Applications Authors:Tsern-Huei Lee; Nai-Lun Huang Publisher:Computer Communications and Networks, 2008. ICCCN '08. Proceedings of 17th International Conference on 3-7 Aug. 2008 Page(s)1 - 7 Present:Chia-Ming ,Chang Date:3, 4, 2009 Department of Computer Science and Information Engineering National Cheng Kung University, Taiwan R.O.C. 1

  2. Outline • 1. Introduction • 2. Architecture • 3. Experimental results • 4. Conclusion 2

  3. Introduction (1/3) 3

  4. Introduction (2/3) 4

  5. Introduction (3/3) 5

  6. Outline • 1. Introduction • 2. Architecture • 3. Experimental results • 4. Conclusion 6

  7. Architecture (1/3) Σ= {a, b, c, d, e, f, g, h} Σ are sequentially encoded as 0, 1, 2, 3, 4, 5,6 and 7 Y= {abcda (0), abba (1), cda (2),cabc (3)}. 7

  8. Architecture (2/3) 8

  9. Architecture (3/3) 9

  10. Outline • 1. Introduction • 2. Architecture • 3. Experimental results • 4. Conclusion 10

  11. Experimental results(1/3) 11

  12. Experimental results(2/3) 12

  13. Experimental results(3/3) 13

  14. Outline • 1. Introduction • 2. Architecture • 3. Experimental results • 4. Conclusion 14

  15. Conclusion (1/1) • we first present an idea to improve the throughput performance of the banded-row format AC and then propose a scalable implementation of the Aho-Corasick pattern matching algorithm. • our proposed implementation achieves 39.7% reduction in memory requirement for 5,000 pattern strings randomly selected from ClamAV signatures and 16.1% reduction in processing time on the average for scanning various types of files. 15

More Related