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

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEICE Transactions on Communications 2010/06/01, Vol.E93.B(6), pp.1612-1614
Hauptverfasser:	KIM, HyunJin, HONG, Hyejeong, BAEK, Dongmyoung, KANG, Sungho
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms and network monitoring Applied sciences computer network security deep packet inspection Exact sciences and technology finite state machine Information, signal and communications theory Inspection Mapping Operation, maintenance, reliability of teleprocessing networks Partitioning pattern matching Pattern recognition Searching Signal processing String matching Strings Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Valuation and optimization of characteristics. Simulation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0916-8516 1745-1345 1745-1345
DOI:	10.1587/transcom.E93.B.1612