A pattern group partitioning for parallel string matching using a pattern grouping metric

Authors:
HyunJin Kim;Sungho Kang
Affiliations:
Samsung Electronics, Hwasung-City, Korea;Samsung Electronics, Hwasung-City, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 2

Efficient string matching: an aid to bibliographic search

Communications of the ACM
Bit-split string-matching engines for intrusion detection and prevention

ACM Transactions on Architecture and Code Optimization (TACO)
Using String Matching for Deep Packet Inspection

Computer

Recent advancements in parallel algorithms for string matching on computing models --- a survey and experimental results

ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
Towards adaptive character frequency-based exclusive signature matching scheme and its applications in distributed intrusion detection

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

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.