상세정보
학술지
A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
- 저자
- 김현진, 홍혜정, 백동명, 강성호
- 발행일
- 201006
- 출처
- IEICE Transactions on Communications, v.E93.B no.6, pp.1612-1614
- ISSN
- 0916-8516
- 출판사
- 일본, 전자정보통신학회 (IEICE)
- 협약과제
- 10MI2800, Scalable 마이크로 플로우 처리기술개발, 이범철
- 초록
- 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 제안 키워드
- Greedy search, Information and communication, Memory-based, Parallel string matching, Partitioning Algorithm, deep packet inspection(DPI), lexicographical sorting, memory requirements, memory-efficient, multiple targets