期刊文献+

基于字频特征的自动机多模匹配增效算法 被引量:4

An automata multi-pattern match efficiency algorithm based the character frequency characteristic
下载PDF
导出
摘要 针对自动机类多模匹配算法内存占用过多的缺点,分析了DFA存储的列特征,并结合模式串所属字符集的编码范围,提出了按字符频率特征压缩自动机状态空间的多模匹配增效算法。本算法采用了输入字符阈值映射技术,在保存高频率字符对应列的同时,用位图信息提高对压缩列的检索速度。实验结果表明,在万条配置规则级的环境下,能够同时有效降低内存和CPU利用率。 Against the shortcomings of taking up too many memory, we propose a multi-pattern match efficiency algorithm according to the character frequency characteristic by analyzed the DFA row characteristic and characters in the string model code.The algorithm has used the input character threshold value mapping technology, preserved high-frequency character correspondence, enhanced with the bitmap information to reduces the retrieval speed. The experimental result indicated that in ten thousand transfer sets, it can simultaneously effectively reduce the memory and CPU use factor.
出处 《微计算机信息》 2009年第3期206-208,共3页 Control & Automation
关键词 自动机算法 字符映射 位图 automata algorithm character map bitmap
  • 相关文献

参考文献6

  • 1A. V. Aho and M. J. Corasick. Effcient string matching:An aid to bibliographic search. Communications of the ACM,18 (6):333 - 340, 1975.
  • 2N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic Memory-Efficient String Mathcing for Intrusion Detection. Proceedings of the IEEE Infocom Conference, 2004.
  • 3Lin Tan and Timothy Sherwood. A High Throughput String Matching Architecture for Intrusion Detection and Prevention. 32st Inteinational Symposium on Computer Architecture (ISCA 2005), 2005.
  • 4李伟男,鄂跃鹏,葛敬国,钱华林.多模式匹配算法及硬件实现[J].软件学报,2006,17(12):2403-2415. 被引量:42
  • 5Dimopoulos, V.Papaefstathiou, I.Pnevmatikatos, D. A Memory- Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems. Embedded Computer Systems: Architectures, Modeling and Simulation, 2007. IC-SAMOS 2007. Interuational Conference on Volume, Issue, 16-19:186-193, July 2007.
  • 6方贤进,李龙澍.多模式匹配算法的优化研究[J].微计算机信息,2007(03X):211-213. 被引量:8

二级参考文献7

  • 1张光云,田丽.传统NIDS漏报和误报起因及改进技术[J].微计算机信息,2006(01X):36-38. 被引量:7
  • 2Alfred V.Aho,Ravi Sethi,Jeffrey D.Ullman.Compilers Principles,Techniques,and Tools[M].Addison Wesley 1986 ISBN 0-201-10086-6,
  • 3I.S.Duff,A.M.Erishman,J.K.Reid.Direct Methods for Sparse Matrices[M].Oxford University Press 1986,ISBN 0-19-85342103.
  • 4Marc Norton.Optimizing Pattern Matching for Intrusion Detection[EB/OL].SourceFire,Inc,September 2004.
  • 5Tarjan,R.E.,and Yao,A.C.-C.Storing a sparse table[J].Commun.ACM 21,11.1979.
  • 6Thomas H.Cormen.Charles E.Leiserson.Ronald L.Rivest.Clifford Stein,Introduction to Algorithms(Second Edition)[M].北京:Higher Education Press&The MIT Press.2002:page909-923.
  • 7王永成,沈州,许一震.改进的多模式匹配算法[J].计算机研究与发展,2002,39(1):55-60. 被引量:52

共引文献48

同被引文献26

  • 1殷丽华,方滨兴.一种改进的多模式匹配算法[J].华中科技大学学报(自然科学版),2005,33(z1):300-303. 被引量:4
  • 2万国根,秦志光.改进的AC-BM字符串匹配算法[J].电子科技大学学报,2006,35(4):531-533. 被引量:20
  • 3蔡晓妍,戴冠中,杨黎斌.改进的多模式字符串匹配算法[J].计算机应用,2007,27(6):1415-1417. 被引量:11
  • 4NAVARRO G, RAFFINOT M. Flexible Pattern Matching in strings [ M ]. Cambridge: Cambridge University Press, 2002.
  • 5AHO A. V, CORASICK M J. Efficient string matching: an aid to bibliographic search[ C]//Commtmications of the ACM. New York: ACM, 1975:333 - 340.
  • 6ALLAUZEN C, RAFFINOT M. Simple optimal string matehing[J]. Journal of Algorithms, 2000, 36(1) :102 -116.
  • 7WU S, MANBER U. A Fast Algorithm for Multi-pattern Searching[ R]. Report TR-94-17, Tucson, AZ: Department of Computer Science, University of Arizona, 1994.
  • 8YAO A C. The complexity of pattern matching for a random string [ J ]. SIAM Journal on Computing, 1979, 8(3) :368 -387.
  • 9TAN L, SHERWOOD T. A high throughput string matching architecture for intrusion detection and prevention[ C]//Proceeding of the 32nd Annual International Symposium on Computer Architecture. Washington : IEEE Computer Society, 2005 : 112 - 122.
  • 10CHARRAS C, LECROQ T. Handbook of Exact Stringmatching Algorithms [ M ]. London: King's College London Publications, 2004.

引证文献4

二级引证文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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