A pattern partitioning algorithm for memory-efficient parallel string matching in deep packet inspection

Hyun Jin Kim, Hyejeong Hong, Dongmyoung Baek, Sungho Kang

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced.

Original languageEnglish
Pages (from-to)1612-1614
Number of pages3
JournalIEICE Transactions on Communications
VolumeE93-B
Issue number6
DOIs
Publication statusPublished - 2010 Jan 1

Fingerprint

Inspection
Data storage equipment
Sorting

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{ba9e938faf3c41d4ae6c270549d7d096,
title = "A pattern partitioning algorithm for memory-efficient parallel string matching in deep packet inspection",
abstract = "This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced.",
author = "Kim, {Hyun Jin} and Hyejeong Hong and Dongmyoung Baek and Sungho Kang",
year = "2010",
month = "1",
day = "1",
doi = "10.1587/transcom.E93.B.1612",
language = "English",
volume = "E93-B",
pages = "1612--1614",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

A pattern partitioning algorithm for memory-efficient parallel string matching in deep packet inspection. / Kim, Hyun Jin; Hong, Hyejeong; Baek, Dongmyoung; Kang, Sungho.

In: IEICE Transactions on Communications, Vol. E93-B, No. 6, 01.01.2010, p. 1612-1614.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A pattern partitioning algorithm for memory-efficient parallel string matching in deep packet inspection

AU - Kim, Hyun Jin

AU - Hong, Hyejeong

AU - Baek, Dongmyoung

AU - Kang, Sungho

PY - 2010/1/1

Y1 - 2010/1/1

N2 - This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced.

AB - This paper proposes a pattern partitioning algorithm that maps multiple target patterns onto homogeneous memory-based string matchers. The proposed algorithm adopts the greedy search based on lexicographical sorting. By mapping as many target patterns as possible onto each string matcher, the memory requirements are greatly reduced.

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

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

U2 - 10.1587/transcom.E93.B.1612

DO - 10.1587/transcom.E93.B.1612

M3 - Article

VL - E93-B

SP - 1612

EP - 1614

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 6

ER -