Hierarchical multi-pattern matching algorithm for network content inspection

  • Authors:
  • Tzu-Fang Sheu;Nen-Fu Huang;Hsiao-Ping Lee

  • Affiliations:
  • Institute of Communication Engineering, National Tsing-Hua University, Taiwan;Institute of Communication Engineering, National Tsing-Hua University, Taiwan and Department of Computer Science, National Tsing-Hua University, 101 Section 2, Kuang-Fu Road, Hsin-Chu 300, Taiwan;Department of Computer Science, National Tsing-Hua University, 101 Section 2, Kuang-Fu Road, Hsin-Chu 300, Taiwan

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

Abstract

Inspection engines that can inspect network content for application-layer information are urgently required. In-depth packet inspection engines, which search the whole packet payload, can identify the interested packets that contain certain patterns. Network equipment then utilizes the searching results from the inspection engines for application-oriented management. The most important technology for fast packet inspection is an efficient multi-pattern matching algorithm to perform exact string matching between packets and a large set of patterns. This paper proposes a novel hierarchical multi-pattern matching algorithm (HMA) for packet inspection. HMA builds hierarchical index tables from the most frequent common-codes, and efficiently reduces the amount of external memory accesses and memory space by two-tier and cluster-wise matching. Analysis and simulation results reveal that HMA performs much better than state-of-the-art matching algorithms. In particular, HMA can update patterns incrementally, thus creating a reliable network system.