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

Hyunjin Kim, Sungho Kang

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 languageEnglish
Article number5547596
Pages (from-to)878-880
Number of pages3
JournalIEEE Communications Letters
Volume14
Issue number9
DOIs
Publication statusPublished - 2010 Sep 1

Fingerprint

String Matching
Intrusion detection
Grouping
Computer hardware
Partitioning
Data storage equipment
Metric
Target
Strings
Approximately equal
Intrusion Detection
Partition
Hardware
Subgroup
Requirements

All Science Journal Classification (ASJC) codes

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

@article{b70f5f869a244bdfb4a14e5311ffef1b,
title = "A pattern group partitioning for parallel string matching using a pattern grouping metric",
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.",
author = "Hyunjin Kim and Sungho Kang",
year = "2010",
month = "9",
day = "1",
doi = "10.1109/LCOMM.2010.080210.092347",
language = "English",
volume = "14",
pages = "878--880",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

A pattern group partitioning for parallel string matching using a pattern grouping metric. / Kim, Hyunjin; Kang, Sungho.

In: IEEE Communications Letters, Vol. 14, No. 9, 5547596, 01.09.2010, p. 878-880.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kim, Hyunjin

AU - Kang, Sungho

PY - 2010/9/1

Y1 - 2010/9/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77957698187&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957698187&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2010.080210.092347

DO - 10.1109/LCOMM.2010.080210.092347

M3 - Article

AN - SCOPUS:77957698187

VL - 14

SP - 878

EP - 880

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 9

M1 - 5547596

ER -