Abstract
Considering the increasing number of target patterns for the intrusion detection systems (IDS), memory requirements should be minimized for reducing hardware overhead. This paper proposes an algorithm that partitions a set of target patterns into multiple subgroups for homogeneous string matchers. Using a pattern grouping metric, the proposed pattern partitioning makes the average length of the mapped target patterns onto a string matcher approximately equal to the average length of total target patterns. Therefore, the variety of target pattern lengths can be mitigated because the number of mapped target patterns onto each string matcher is balanced.
| Original language | English |
|---|---|
| Article number | 5547596 |
| Pages (from-to) | 878-880 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 14 |
| Issue number | 9 |
| DOIs | |
| Publication status | Published - 2010 Sep 1 |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'A pattern group partitioning for parallel string matching using a pattern grouping metric'. Together they form a unique fingerprint.
Cite this
Kim, H., & Kang, S. (2010). A pattern group partitioning for parallel string matching using a pattern grouping metric. IEEE Communications Letters, 14(9), 878-880. [5547596]. https://doi.org/10.1109/LCOMM.2010.080210.092347