Efficient multiple pattern matching algorithms for network intrusion detection systems
- Authors
- Lee, Sunho; Kim, Dong Kyue
- Issue Date
- Nov-2009
- Publisher
- IEEE
- Keywords
- Aho-Corasick; Multiple pattern matching; Network intrusion detection; Trie; Wu-Manber
- Citation
- Proceedings of 2009 IEEE International Conference on Network Infrastructure and Digital Content, IEEE IC-NIDC2009, pp.609 - 613
- Indexed
- SCOPUS
- Journal Title
- Proceedings of 2009 IEEE International Conference on Network Infrastructure and Digital Content, IEEE IC-NIDC2009
- Start Page
- 609
- End Page
- 613
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175877
- DOI
- 10.1109/ICNIDC.2009.5360944
- Abstract
- Multiple pattern matching algorithms are essential engines of Network Intrusion Detection Systems (NIDSs) to inspect packets for occurrences of malicious patterns. For a set of patterns, the multiple pattern matching algorithms usually build a trie data structure. In this paper, we propose efficient implementations of the multiple pattern matching algorithms widely used in NIDSs by using a linearized compact trie. This linearized compact trie is an array representation of a compact trie and guarantees a size linear to the number of patterns with little loss of lookup time. Thus, our implementations achieve compact sizes with fast time, so it is useful to hardware embedding and cache exploiting.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175877)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.