面向网络安全的新型字符串匹配技术

Yuebin Bai, Hidetsune Kobayashi
{"title":"面向网络安全的新型字符串匹配技术","authors":"Yuebin Bai, Hidetsune Kobayashi","doi":"10.1109/AINA.2003.1192870","DOIUrl":null,"url":null,"abstract":"String matching is a comprehensive applicable key technology beyond intrusion detection systems (IDS), and many areas can benefit from faster string matching algorithm. Which can be used in IDS, firewall et al network security applications. These applications are usually deployed at choke points of a network where there is heavily traffic. Using lower efficient string matching algorithm may make these applications to become a performance bottleneck in network. So it is very necessary to develop faster and more efficient string matching algorithms in order to overcome the troubles on performance. On a basis of Boyer-Moore-Horspool algorithm, a new string matching algorithm is presented in this paper. The algorithm is described in detail. The new algorithm has been greatly improved. The algorithm is one simplification of Boyer-Moore-Horspool algorithm. Array NEXT in Preprocessing stage is redesigned. A novel generated rules are presented. Using these rules, a simple NEXT is generated. And based on the concept of reference point, all make the algorithm to have better performance and more efficient. These characteristics will be useful in all these applications. Main features of the algorithm are presented, then explained its work processes. The algorithm also passed test and is validated. The test results show that the algorithm has better performance than Boyer-Moore algorithm and Boyer-Moore-Horspool algorithm, and more simple and efficient.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"New string matching technology for network security\",\"authors\":\"Yuebin Bai, Hidetsune Kobayashi\",\"doi\":\"10.1109/AINA.2003.1192870\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"String matching is a comprehensive applicable key technology beyond intrusion detection systems (IDS), and many areas can benefit from faster string matching algorithm. Which can be used in IDS, firewall et al network security applications. These applications are usually deployed at choke points of a network where there is heavily traffic. Using lower efficient string matching algorithm may make these applications to become a performance bottleneck in network. So it is very necessary to develop faster and more efficient string matching algorithms in order to overcome the troubles on performance. On a basis of Boyer-Moore-Horspool algorithm, a new string matching algorithm is presented in this paper. The algorithm is described in detail. The new algorithm has been greatly improved. The algorithm is one simplification of Boyer-Moore-Horspool algorithm. Array NEXT in Preprocessing stage is redesigned. A novel generated rules are presented. Using these rules, a simple NEXT is generated. And based on the concept of reference point, all make the algorithm to have better performance and more efficient. These characteristics will be useful in all these applications. Main features of the algorithm are presented, then explained its work processes. The algorithm also passed test and is validated. The test results show that the algorithm has better performance than Boyer-Moore algorithm and Boyer-Moore-Horspool algorithm, and more simple and efficient.\",\"PeriodicalId\":382765,\"journal\":{\"name\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2003.1192870\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2003.1192870","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

字符串匹配是入侵检测系统之外的一项综合适用的关键技术,更快的字符串匹配算法可以使许多领域受益。其中可用于IDS,防火墙等网络安全应用。这些应用程序通常部署在流量很大的网络阻塞点。使用效率较低的字符串匹配算法可能会使这些应用程序成为网络中的性能瓶颈。因此,开发更快、更高效的字符串匹配算法以克服性能上的困扰是十分必要的。本文在Boyer-Moore-Horspool算法的基础上,提出了一种新的字符串匹配算法。对该算法进行了详细的描述。新算法有了很大的改进。该算法是对Boyer-Moore-Horspool算法的一种简化。对预处理阶段的NEXT数组进行了重新设计。提出了一种新的生成规则。使用这些规则,将生成一个简单的NEXT。并且基于参考点的概念,使算法具有更好的性能和更高的效率。这些特性在所有这些应用程序中都很有用。介绍了该算法的主要特点,并对其工作过程进行了说明。该算法通过了测试并得到了验证。测试结果表明,该算法比Boyer-Moore算法和Boyer-Moore- horspool算法具有更好的性能,且更简单高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
New string matching technology for network security
String matching is a comprehensive applicable key technology beyond intrusion detection systems (IDS), and many areas can benefit from faster string matching algorithm. Which can be used in IDS, firewall et al network security applications. These applications are usually deployed at choke points of a network where there is heavily traffic. Using lower efficient string matching algorithm may make these applications to become a performance bottleneck in network. So it is very necessary to develop faster and more efficient string matching algorithms in order to overcome the troubles on performance. On a basis of Boyer-Moore-Horspool algorithm, a new string matching algorithm is presented in this paper. The algorithm is described in detail. The new algorithm has been greatly improved. The algorithm is one simplification of Boyer-Moore-Horspool algorithm. Array NEXT in Preprocessing stage is redesigned. A novel generated rules are presented. Using these rules, a simple NEXT is generated. And based on the concept of reference point, all make the algorithm to have better performance and more efficient. These characteristics will be useful in all these applications. Main features of the algorithm are presented, then explained its work processes. The algorithm also passed test and is validated. The test results show that the algorithm has better performance than Boyer-Moore algorithm and Boyer-Moore-Horspool algorithm, and more simple and efficient.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An efficient optimal algorithm for virtual path bandwidth allocation RIDEE: a realtime and interactive distance education support system Detection of multiple bottleneck bandwidth Update operation and partition dependency in distributed database systems A proposal of a multi-agent supporting system for network community formation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1