A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.6 pp.1612-1614
- Publication Date
- 2010/06/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1612
- Type of Manuscript
- LETTER
- Category
- Network Management/Operation
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
HyunJin KIM, Hyejeong HONG, Dongmyoung BAEK, Sungho KANG, "A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 6, pp. 1612-1614, June 2010, doi: 10.1587/transcom.E93.B.1612.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1612/_p
Copy
@ARTICLE{e93-b_6_1612,
author={HyunJin KIM, Hyejeong HONG, Dongmyoung BAEK, Sungho KANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection},
year={2010},
volume={E93-B},
number={6},
pages={1612-1614},
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.},
keywords={},
doi={10.1587/transcom.E93.B.1612},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
T2 - IEICE TRANSACTIONS on Communications
SP - 1612
EP - 1614
AU - HyunJin KIM
AU - Hyejeong HONG
AU - Dongmyoung BAEK
AU - Sungho KANG
PY - 2010
DO - 10.1587/transcom.E93.B.1612
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2010
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.
ER -
English
