BROWSE
Detail
Journal Article
A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
Cited 9 time in 
Share 
Share
- 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
- 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
- Information and communication, Memory-based, Parallel string matching, Partitioning Algorithm, deep packet inspection(DPI), greedy search, lexicographical sorting, memory requirements, memory-efficient, multiple targets