MDH: A High Speed Multi-phase Dynamic Hash String Matching Algorithm for Large-Scale Pattern Set

• Published in: Information and Communications Security Vol. 4861; pp. 201 - 215
• Main Authors: Zhou, Zongwei, Xue, Yibo, Liu, Junda, Zhang, Wei, Li, Jun
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2007; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Dynamic-Cut Heuristics; Multi-Phases Hash; Network Security; String Matching Algorithm
• ISBN: 9783540770473; 354077047X
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-540-77048-0_16

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.