Improving a hierarchical pattern matching algorithm using cache-aware Aho-Corasick automata

Authors:
Phuong Do;Ho-Seok Kang;Sung-Ryul Kim
Affiliations:
Konkuk University, Seoul, Korea;Konkuk University, Seoul, Korea;Konkuk University, Seoul, Korea
Venue:
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Year:
2012

Citing 4
Cited 0

A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
In-Depth Packet Inspection Using a Hierarchical Pattern Matching Algorithm

IEEE Transactions on Dependable and Secure Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Enhanced Hierarchical Multipattern Matching Algorithm (EHMA) is an efficient pattern matching algorithm that divides the matching process into two phases so that it may reduce the number of the external memory accesses. But when the number of the patterns increases, the algorithm may not work well. In this paper we propose a method to solve this problem by combining EHMA algorithm with the Aho-Corasick algorithm. We also take into consideration the effect of cache memory in the network equipment by implementing a cache-aware algorithm that exploits the frequency of the characters in the network payload and the transition probability of links in the Aho-Corasick automata. The experiments show that our improvement can help to significantly reduce the number of the external memory access, compared to the original EHMA.