期刊文献+

一种基于入侵检测的模式匹配算法研究 被引量:1

Pattern Matching Algorithm Based on Distributed Intrusion Detection System
下载PDF
导出
摘要 通过对入侵检测系统的基本概念、发展历史和趋势进行详细论述,以及对各种检测方法进行深入的分析,在Boye Moore算法的基础上提出了一种改进算法来实现入侵检测的关键部分——模式匹配,提高了探测引擎的处理速度。通过实验验证,该改进技术能明显提高系统的检测效率和稳定性,达到了对系统研究和设计的初衷。 The basic concept, history and development trend of intrusion detection are expound in detail, and all kinds of detection methods are studied, then a new intrusion detection algorithm based on Boye Moore algorithm is proposed to realize pattern matching which is the key part in intrusion detection. The new algorithm can improve the detection speed of engine. The experiments show that the technology can greatly improve the efficiency and stability of the system, and meet the requirements of design.
作者 苗亮 汪瑾
机构地区 中北大学
出处 《机械工程与自动化》 2011年第1期80-81,84,共3页 Mechanical Engineering & Automation
关键词 入侵检测系统(IDS) BM算法 模式匹配 intrusion detection system Boye Moore algorithm pattern matching
  • 相关文献

参考文献2

二级参考文献17

  • 1Charras C, Lecroq TT. Handbook of Exact String Matching Algorithms. London: King's College London Publications, 2004.
  • 2Knuth DE, Jr. Morris JH, Pratt VR. Fast pattern matching in strings. SIAM Journal on Computing, 1977,6(1):323-350.
  • 3Baeza-Yates RA, Gonnet GH. A new approach to text searching. Communications of the ACM, 1992,35(10):74-82.
  • 4Boyer RS, Moore JS. A fast string searching algorithm. Communications of the ACM, 1977,20(10):762-772.
  • 5Sunday DM. A very fast substring search algorithm. Communications of the ACM, 1990,33(8):132-142.
  • 6Cantone D, Faro S. Fast-Search: A new efficient variant of the Boyer-Moore string matching algorithm. In: Alberto A, Massimo M, eds. Proc. of the 2nd Int'l Workshop on Experimental and Efficient Algorithms (WEA 2003). Lecture Notes in Computer Science 2647, Heidelberg: Springer-Verlag, 2003.47-58.
  • 7Crochemore M, Rytter W. Text Algorithms. Oxford: Oxford University Press, 1994.
  • 8Lecroq T. A variation on the Boyer-Moore algorithm. Theoretical Computer Science, 1992,92(1):119-144.
  • 9Crochemore M, Hancart C. Automata for matching patterns. In: Rosenberg G, Salomaa A, eds. Handbook of Formal Languages,volume 2: Linear Modeling: Background and Application. Heidelberg: Springer-Verlag, 1997. 399-462.
  • 10Yao AC. The complexity of pattern matching for a random string. SIAM Journal on Computing, 1979,8(3):368-387.

共引文献24

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部