A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection

HyunJin KIM; Hyejeong HONG; Dongmyoung BAEK; Sungho KANG

doi:10.1587/transcom.E93.B.1612

IEICE Transactions on Communications

Online ISSN : 1745-1345
Print ISSN : 0916-8516

Regular Section

A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection

HyunJin KIM, Hyejeong HONG, Dongmyoung BAEK, Sungho KANG

Author information

Keywords: computer network security, deep packet inspection, finite state machine, pattern matching, and network monitoring

JOURNAL RESTRICTED ACCESS

2010 Volume E93.B Issue 6 Pages 1612-1614

DOI https://doi.org/10.1587/transcom.E93.B.1612

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!