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.
Chapter PDF
Similar content being viewed by others
References
Roesch, M.: Snort: lightweight intrusion detection for networks. In: Proc. of the 1999 USENIX LISA Systems Administration Conference (1999)
Clam AntiVirusTM http://www.clamav.net/
Navarro, G., Raffinot, M.: Flexible pattern matching in strings. Cambridge University Press, Cambridge (2002)
Wu, S., Manber, U.: A fast algorithm for multi-pattern searching, Technical Report TR-94-17, Department of Computer Science, University of Arizona (1994)
Snort, http://www.snort.org/
Aho, A., Corasick, M.: Fast pattern matching: an aid to bibliographic search. Journal on Communication ACM 18(6), 333–340 (1975)
Boyer, R., Moore, J.: A fast string searching algorithm. Journal on Communication. ACM 20(10), 762–772 (1977)
Coit, C., Staniford, S., McAlerney, J.: Towards faster string matching for intrusion detection or exceeding the speed of snort, DARPA Information Survivability Conference and Exposition, pp. 367–373 (2001)
Fisk, M., Varghese, G.: An analysis of fast string matching applied to content-based forwarding and intrusion detection. Technical Report CS2001-0607 (updated version), University of California-San Diego (2002)
Xu, B., Zhou, X., Li, J.: Recursive shift indexing: a fast multi-pattern string matching Algorithm. In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, Springer, Heidelberg (2006)
Kytojoki, J., Salmela, L., Tarhio, J.: Tuning string matching for huge pattern sets? In: Baeza-Yates, R.A., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 211–224. Springer, Heidelberg (2003)
Allauzen, C., Raffinot, M.: Factor oracle of a set of words, Technical report 99-11, Institut Gaspard-Monge, Universite de Marne-la-Vallee (1999)
National Computer Network Emergency Response Technical Team/Coordination Center of China, http://www.cert.org.cn/
Network Security Lab: Research Institute of Information Technology, Tsinghua University, Beijing, http://security.riit.tsinghua.edu.cn/share/pattern.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Z., Xue, Y., Liu, J., Zhang, W., Li, J. (2007). MDH: A High Speed Multi-phase Dynamic Hash String Matching Algorithm for Large-Scale Pattern Set. In: Qing, S., Imai, H., Wang, G. (eds) Information and Communications Security. ICICS 2007. Lecture Notes in Computer Science, vol 4861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77048-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-77048-0_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77047-3
Online ISBN: 978-3-540-77048-0
eBook Packages: Computer ScienceComputer Science (R0)