首页|A Multi-pattern Matching Algorithm Based on Double Array Trie

A Multi-pattern Matching Algorithm Based on Double Array Trie

扫码查看
With the increasing of network throughput, the size of pattern sets in Network Intrusion Detection System (NIDS) are growing gradually, how to reduce memory space of pattern sets has become one of the research hot spots。 This paper presents a multi-pattern matching algorithm which combines the classical Aho-Corasick (AC) algorithm with Double Array Trie (DAT), called DAT-AC。 We use two linear arrays to determine the state transition and decrease the memory space by reducing the unnecessary state transition。 Experimental results demonstrate that DAT-AC performs better than the classical AC algorithm, when the number of pattern is larger than five thousand。

multi-pattern matchingACDATDAT-AC

Miao Hou、YingHui Song、Dongliang Xu、Hongli Zhang

展开 >

School of Computer Science and Technology, Harbin Institute of Technology Harbin, China

FTRA international conference on computer science and its applications;International symposium on system engineering and computer simulation;International workshop on creation, management and application of medical and biological data

Danang(VN)

Advanced in computer science and its applications

863-868

2013