一种基于BM的入侵检测优化匹配算法  

An Optimized Matching Algorithmfor Intrusion Detection Based on BM

作　　者：李俊涛[1] LI Jun-tao(Party School of Qinghai Provincial Committee of CPC,Xining,Qinghai,China 810001)

机构地区：[1]中共青海省委党校,青海西宁810001

出　　处：《湖南邮电职业技术学院学报》2020年第4期21-23,30,共4页Journal of Hunan Post and Telecommunication College

摘　　要：随着高速网络时代的到来,传统入侵检测系统低效率的模式匹配算法,已无法满足各类大吞吐量网络检测、搜索引擎的需求。为此文章在BM算法和其他匹配算法的基础上,结合BM坏字符串的跨越规则,提出了一种新的改进算法。该算法通过忽略文本串不属于模式串字符,有效增大了右移距离,减少了匹配次数,提高了匹配的效率。最后通过实验对比,进一步验证了改进算法优于BM算法,对今后高速网络大吞吐量的入侵检测有一定的借鉴意义。With the advent of the era of high-speed network,the inefficient pattern matching algorithm of traditional intrusion detection system has been unable to meet the needs of all kinds of high-throughput network detection and search engine.In this paper,based on BM algorithm and other matching algorithms,combined with the jumping rule of BM bad string,a new improved algorithm is proposed.By neglecting that the text string does not belong to pattern string characters,the algorithm effectively increases the right shift distance,reduces the number of matching times and improves the matching efficiency.Finally,the experimental results show that the improved algorithm is better than BM algorithm.It can be used for reference in intrusion detection of high-speed network with large throughput in the future.

关 键 词：入侵检测 BM算法 模式匹配 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]