ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
Cited 9 time in scopus Download 15 time Share share facebook twitter linkedin kakaostory
Authors
HyunJin KIM, Hyejeong HONG, Dongmyoung BAEK, Sungho KANG
Issue Date
2010-06
Citation
IEICE Transactions on Communications, v.E93.B, no.6, pp.1612-1614
ISSN
0916-8516
Publisher
일본, 전자정보통신학회 (IEICE)
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1587/transcom.E93.B.1612
Project Code
10MI2800, Development of Scalable Micro Flow Processing Technology, Lee Bhum Cheol
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. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.
KSP Keywords
Greedy search, Information and communication, Memory-based, Parallel string matching, Partitioning Algorithm, deep packet inspection(DPI), lexicographical sorting, memory requirements, memory-efficient, multiple targets