Skip to main navigation Skip to search Skip to main content

A Multi-pattern matching algorithm based on double array trie

  • Miao Hou*
  • , Yinghui Song
  • , Dongliang Xu
  • , Hongli Zhang
  • *Corresponding author for this work
  • School of Computer Science and Technology, Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationAdvanced in Computer Science and Its Applications, CSA 2013
PublisherSpringer Verlag
Pages863-868
Number of pages6
ISBN (Print)9783642416736
DOIs
StatePublished - 2014
Externally publishedYes
Event5th FTRA International Conference on Computer Science and its Applications, CSA 2013 - Danang, Viet Nam
Duration: 18 Dec 201321 Dec 2013

Publication series

NameLecture Notes in Electrical Engineering
Volume279 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

Conference5th FTRA International Conference on Computer Science and its Applications, CSA 2013
Country/TerritoryViet Nam
CityDanang
Period18/12/1321/12/13

Keywords

  • AC
  • DAT
  • DAT-AC
  • multi-pattern matching

Fingerprint

Dive into the research topics of 'A Multi-pattern matching algorithm based on double array trie'. Together they form a unique fingerprint.

Cite this