MDH: a high speed multi-phase dynamic hash string matching algorithm for large-scale pattern set

  • Authors:

  • Zongwei Zhou;Yibo Xue;Junda Liu;Wei Zhang;Jun Li

  • Affiliations:

  • Department of Computer Science and Technology, Tsinghua University, Beijing, China and Research Institute of Information Technology, Tsinghua University, Beijing, China;Research Institute of Information Technology, Tsinghua University, Beijing, China and Tsinghua National Laboratory for Information Science and Technology, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China and Research Institute of Information Technology, Tsinghua University, Beijing, China;Department of Computer Science and Technology, Tsinghua University, Beijing, China and Research Institute of Information Technology, Tsinghua University, Beijing, China;Research Institute of Information Technology, Tsinghua University, Beijing, China and Tsinghua National Laboratory for Information Science and Technology, Beijing, China

  • Venue:
  • ICICS'07 Proceedings of the 9th international conference on Information and communications security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

String matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both calls for high speed string matching algorithm for large-scale pattern set. This paper proposes a novel algorithm called Multi-phase Dynamic Hash (MDH), which cut down the memory requirement by multi-phase hash and explore valuable pattern set information to speed up searching procedure by dynamic-cut heuristics. The experimental results demonstrate that MDH can improve matching performance by 100% to 300% comparing with other popular algorithms, whereas the memory requirement stays in a comparatively low level.