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

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

doi:10.1587/transcom.E93.B.1612

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

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

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

9 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 language	English
Pages (from-to)	1612-1614
Number of pages	3
Journal	IEICE Transactions on Communications
Volume	E93-B
Issue number	6
DOIs	https://doi.org/10.1587/transcom.E93.B.1612
Publication status	Published - 2010 Jun

All Science Journal Classification (ASJC) codes

Software
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1587/transcom.E93.B.1612

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 = jun,

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",

}

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/6

Y1 - 2010/6

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

AN - SCOPUS:77952981376

SN - 0916-8516

VL - E93-B

SP - 1612

EP - 1614

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

IS - 6

ER -

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

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this