期刊文献+

入侵检测系统中的带权模式匹配算法 被引量:1

Weighted Patterns Matching Algorithms in IDS
在线阅读 下载PDF
导出
摘要 入侵检测系统(IDS)需要根据每个模式串的权值,计算给定主串的总权值并反馈给报警系统。传统的模式匹配算法在计算主串权值时效率低。为此,文中在Aho-Corasick算法的基础上,提出了带权模式匹配算法(WPM)及其改进算法(WPME)。算法优化了自动机的建立过程,对自动机每个节点的失配后继指针信息和匹配量信息进行预处理,从而避免了模式匹配阶段在计算主串权值时的回溯操作,降低了算法的时间复杂度。实验表明,改进后的算法具有效率高、匹配精确的特点。 Intrusion Detection System (IDS) needs to calculate the total weight of the main string and send the result to the alarm system based on the weight of each pattern string. A Weighted Patterns Matching (WPM) algorithm is proposed, which is efficient on receiving the weight of the main string based on AC algorithm. The proposed algorithm achieves information such as the subsequence pointers and matching times for each state during building automata. Therefore, the proposed algorithm reduces the time complexity by reducing the backtracking times when calculating the total weight of the main string in pattern matching stage. Experimental results show that the algorithm has advantages in efficiency, matching accuracy.
出处 《计算机技术与发展》 2014年第2期160-163,共4页 Computer Technology and Development
基金 国家自然科学基金资助项目(61170108) 浙江省新苗人才计划基金资助项目(2011R404018)
关键词 入侵检测系统 带权模式匹配 自动机 报警系统 intrusion detection system weighted patterns matching automata alarm system
  • 相关文献

参考文献9

  • 1Knuth D E, Morris J H. Pattern matching in strings [ J ]. SIAM journal on computing, 1977,6 (2) : 323-350.
  • 2Boyer R S, Moore J S. A fast string searching algorithm [ J ]. Communications of the ACM, 1988,20 (10) :762-772.
  • 3Sunday D M. A very fast substring search algorithm[J]. Com- munications of the ACM, 1990,33 ( 8 ) : 132-142.
  • 4Aho A V, Corasick M J. Efficient string matching:An aid to bibliographic search [ J ]. Communications of the ACM, 1975, 18(6) :330-340.
  • 5Wu Sun, Manber U. A fast algorithm for multi-pattern search- ing[ D ]. Taiwan, China: Chung-Cheng University, 1994.
  • 6宁卓,龚俭.入侵检测系统中的多模式精确匹配算法WDawgMatch[J].计算机工程与科学,2010,32(8):17-21. 被引量:5
  • 7陈新驰,韩建民,贾泂.基于AC自动机的多模式匹配算法FACA[J].计算机工程,2012,38(11):173-176. 被引量:3
  • 8Comments W R. A string matching algorithm fast on the aver- age [ C ]//Proceedings of the 6 th colloquium on automata, lan- guage and programming. [ s. 1. ] :Springer-Verlag, 1979.
  • 9陈牮华.网络入侵检测系统中的模式匹配算法优化研究[J].计算机仿真,2011,28(2):160-162. 被引量:10

二级参考文献21

  • 1戴扬波,左骅.入侵检测系统的联动与功能[J].邮电设计技术,2005(7):52-54. 被引量:2
  • 2Aho A V, Corasick M J. Efficient String Matching: An Aid to Bibliographic Search[J]. Communications of the ACM, 1975, 18(6):333-340.
  • 3Boyer R S, Moore J S. A Fast String Searching Algorithm [J]. Communications of the Association for Computing Machinery, 1977,20(10) :762-772.
  • 4Fish M, Varghese G. Fast Content-Based Packet Handling for Intrusion Detection[R]. UCSD Technical Report CS2001- 0670,2001.
  • 5Crochemore M, Hancart C. Automata for Matching Patterns [M]//Rosenberg G, Salomaa A, eds. Handbook of Formal Languages. Springer-Verlag, 1997 : 399-462.
  • 6Blumer A, Blumer J, Eherenfeucht A, et al. Linear Size Finite Automata for the Set of All Subwords of a Word.. An Outline of Results[J]. Bulletin of European Association for Theoretical Computer Science, 1983,21 : 12-20.
  • 7Knuth D E, Morris J H. Pattern Matching in Strings[J]. SIAM Journal on Computing, 1977, 6(2): 323-350.
  • 8Boyer R S, Moore J S. A Fast String Searching Algorithm[J]. Communications of the ACM, 1988, 31(10): 762-772.
  • 9Sunday D M. A Very Fast Substring Search Algorithm[J]. Communications of the ACM, 1990, 33(8): 132-142.
  • 10Aho A V, Corasick M J. Efficient String Matching: An Aid to Bibliographic Search[J]. Communications of the ACM, 1975, 18(6): 330-340.

共引文献14

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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