期刊文献+

基于WM算法的多模式匹配改进算法WMN 被引量:6

Improved pattern matching algorithm based on WM
下载PDF
导出
摘要 入侵检测系统中有部分时间用来进行模式匹配,因此提高模式匹配算法的处理速度具有重要的意义。从两个方面改进了目前公认效率较高的多模式匹配算法WM,设计出WMN算法,并对该算法进行了性能测试和分析。实验证明该文提出的WMN算法能够有效提高模式匹配的处理速度。 The intrusion detection system always spends some time on pattern matching,thus speeding pattern matching algorithm is a significant research.This paper presents an improved pattern matching algorithm,called WMN,in which the duplicate functions in related tables are eliminated and the next character in a text window is used to determine the distance of right shift of the text window.The performance testing shows that the presented algorithm is more efficient.
出处 《计算机工程与应用》 CSCD 北大核心 2007年第15期128-130,143,共4页 Computer Engineering and Applications
基金 上海市教委自然科学基金( the Natural Science Foundation of Shanghai Municipal Education Commission of China under Grant No. 05JC05051) 上海市教委E研究院-上海高校网格项目( "SEC E- Institute: Shanghai High Institutions Grid"Project under Grant No. 200312)。
关键词 模式匹配算法 WM算法 WMN算法 pattern matching WM algorithm WMN algorithm
  • 相关文献

参考文献12

  • 1Denning D E.An intrusion detection model[J].IEEE Transaction on Software Engineering,1987,13(2):222-223.
  • 2Coit C J,Staniford S,McAlerney J.Towards faster string matching for intrusion detection or exceeding the speed of snort[C]//DARPA Information Surcicability Conference and Exposition,2001.
  • 3Knuth D E,Morris J H,Pratt V R.Fast pattern matching in strings[J].SIAM Journal on Computing,1977,6(1):323-350.
  • 4Boyer R S,Moore J S.A fast string searching algorithm[J].Communications of the ACM,1977,20(10):762-772.
  • 5Horspool R N.Practical fast searching in strings[J].Software-Practice & Experience,1980,10(6):501-506.
  • 6Karp R M,Rabin M O.Efficient randomized pattern-matching algorithms[J].IBM J Res Develop,1987,31 (2):249-260.
  • 7Sunday D M.A very fast substring search algorithm[J].Communications of the ACM,1990,33(8):132-142.
  • 8Aho A V,Corasick M J.Efficient string matching:an aid to bibliographic search[J].Communication of the ACM,1975,18 (6):333-340.
  • 9Sun Wu,Udi Manber.Agrep-A fast approximate pattern-matching tool[C]//Usenix Winter Technical Conference,1992:153-162.
  • 10Tuck N,Sherwood T,Calder B,et al.Deterministic memory-efficient string matching algorithms for intrusion detection[C]//Proceedings of the IEEE Infocom Conference,2004.

二级参考文献9

  • 1Boyer RS, Moore JS. A fast string searching algorithm[ M]. Communications of the ACM20, 1977. 762- 772.
  • 2Sun W, Manber U. A Fast Algorithm For Multi-pattern Searching[ D]. The Computer Science Department of The University of Arizona, 1994.
  • 3Sun W, Manber U. Agrep-A Fast Approximate Pattem-matching Tool[M]. Usenix Winter Technical Conference, 1992.
  • 4Kim S. A Fast Multiple String - Pattern Matching Algorithm [ A ] .17th AoM/IAoM International Conference on Computer Science[ C].San Diego CA, August 1999.
  • 5D E Knuth, J H Morris, V R Pratt. Fast pattern matching in strings. SIAM Journal Computer, 1977, 6(2): 323~350
  • 6R S Boyer, J S Moore. A fast string searching algorithm. Communications of the ACM, 1977, 20(10): 762~772
  • 7Sunday M Daniel. A very fast substring search algorithm. Communications of the ACM, 1990, 33(8): 132~142
  • 8A V Aho, M J Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 1975, 18(6): 333~340
  • 9Fan Jang-Jong, Su Keh-Yih. An efficient algorithm for match multiple patterns. IEEE Trans on Knowledge and Data Engineering, 1993, 5(2):339~351

共引文献75

同被引文献37

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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