期刊文献+

基于蚁群优化的正则表达式分组算法 被引量:2

Regular expression grouping algorithm based on ant colony optimization
下载PDF
导出
摘要 依据Becchi算法的思想基础,提出基于蚁群优化的改进正则表达式分组算法.根据正则表达式间分组的特点,定义正负影响关系的冲突信息和启发函数,构建信息素更新策略.实验结果表明,该算法较Becchi算法能更加客观合理地反映模式集中正则表达式间的优化合并信息,能有效减少状态数量,达到总状态数最优解,降低正则表达式匹配的复杂度. Following the idea of the Becchi algorithm,an improved regular expressions grouping algorithm based on ant colony optimization(GRE-ACO) was introduced.Taking account of the characteristics of regular expressions grouping,GRE-ACO defined the relationship between positive and negative effects of conflict information,a new heuristic function and pheromone update strategy.Comparison with the Becchi algorithm shows that GRE-ACO can reflect the optimizing merge information of the regular expressions more reasonably,reduce the amount of states effectively,and attain the optimal solution of the total number of state.As a result,the GRE-ACO can reduce the complexity of matching algorithm.
出处 《深圳大学学报(理工版)》 EI CAS 北大核心 2014年第3期279-285,共7页 Journal of Shenzhen University(Science and Engineering)
基金 国家自然科学基金资助项目(61171124)~~
关键词 人工智能 蚁群优化算法 深度包检测 正则表达式 分组算法 冲突信息 信息素 网络安全 artificial intelligence ant colony optimization deep packet detection regular expression(RE) grouping algorithm conflict information pheromone network security
  • 相关文献

参考文献19

  • 1Aho A V,Corasick M J.Efficient string matching:an aid to bibliographic search[J].Communications of the ACM,1975,18(6):333-340.
  • 2Wu S,Manber U.A fast algorithm for multi-pattern searching[R].TR-94-17.Tucson(USA):University of Arizona,1994.
  • 3Sommer R,Paxson V.Enhancing byte-level network intrusion detection signatures with context signatures with context[C]// Proceedings of the 10th ACM Conference on Computer and Communications Security.New York(USA):ACM,2003:262-271.
  • 4Yu F,Chen Z F,Diao Y,et al.Fast and memory-efficient regular expression matching for deep packet inspection[C]// Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems.New York(USA):ACM,2006:93-102.
  • 5Becchi M,Crowley P.A hybrid finite automaton for practical deep packet inspection[C]// Proceedings of the ACM CoNEXT Conference.New York(USA):ACM,2007,1:1-12.
  • 6Becchi M,Cadambi S.Memory-efficient regular expression search using state merging[C]// The 26th IEEE International Conference on Computer Communications.Anchorage(USA):IEEE Press,2007:1064-1072.
  • 7Becchi M,Franklin M,Crowley P.A workload for evaluating deep packet inspection architectures[C]// IEEE International Symposium on Workload Characterization.Seattle(USA):IEEE Press,2008:79-89.
  • 8肖武德.一种正则表达式的高效分组算法[J].计算机安全,2010(4):57-59. 被引量:4
  • 9魏强,李云照,褚衍杰.基于图划分的正则表达式分组算法[J].计算机工程,2012,38(18):137-139. 被引量:3
  • 10柳厅文,孙永,卜东波,郭莉,方滨兴.正则表达式分组的1/(1-1/k)-近似算法[J].软件学报,2012,23(9):2261-2272. 被引量:12

二级参考文献54

  • 1李曼,王大治,杜小勇,王珊.基于领域本体的Web服务动态组合[J].计算机学报,2005,28(4):644-650. 被引量:141
  • 2张成文,苏森,陈俊亮.基于遗传算法的QoS感知的Web服务选择[J].计算机学报,2006,29(7):1029-1037. 被引量:103
  • 3张维存,郑丕谔,吴晓丹.蚁群遗传算法求解能力约束的柔性作业车间调度问题[J].计算机集成制造系统,2007,13(2):333-337. 被引量:30
  • 4黄翰,郝志峰,吴春国,秦勇.蚁群算法的收敛速度分析[J].计算机学报,2007,30(8):1344-1353. 被引量:72
  • 5J. Levandoski, E. Sommer, and M. Strait. Application Layer Packet Classifier for Linux. 网址: http://17-filter. sourceforge. net/.
  • 6SNORT Network Intrusion Detection System. 网址: http:// www. snort. org.
  • 7中科院计算所网络信息安全研究组译.柔性字符串匹配,电子工业出版社,2007.
  • 8Fang YU, Zhifeng Chen, Yanlei Diao, T. V. Lakshman. Randy H. Katz, Fast and memory-efficient regular expression matching for deep packet inspection. Proceedings of the 2006ACM/IEEE symposium on ANCS, December 03 05, 2006, San Jose, California, USA.
  • 9S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley and J. Turner. Algorithms to accelerate mul-tiple regular expressions matching for deep packet inspection. ACM SIGCOMM ComputerCommunication R, eview, 56(4): 339 - 350, 2006.
  • 10Dorigo M, Maniezzo V, Colorni A. Ant system: optimiza tion by a colony cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics- Part B: Cybernetics, 1996,26(1): 29-41.

共引文献136

同被引文献27

  • 1金晶,苏勇.一种改进的自适应遗传算法[J].计算机工程与应用,2005,41(18):64-69. 被引量:81
  • 2Aho A V, Corasick M J. Efficient string matching: an aid to bibliographic search [ J ]. Communications of the ACM, 1975, 18(6) : 333-340.
  • 3Wu S, Manber U. A fast algorithm for multi-pattern searching [R]. TR-94-17. Tucson (USA): University of Arizona, 1994.
  • 4Allauzen C, Crochemore M, Raffinot M. Factor oracle: a new structure for pattern matching [ C ] // SOFSEM'99: Theory and Practice of Informatics. Berlin: Springer, 1999 : 295-310.
  • 5Yu F, Chen Z F, Diao Y, et al. Fast and memory- efficient regular expression matching for deep packet inspection [ C ]// Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communi- cations systems. New York ( USA ) Association for Computing Machinery, 2006: 93-102.
  • 6Becchi M, Cadambi S. Memory-efficient regular expres- sion search using state merging [ C]// The 26th IEEE International Conference on Computer Communications. Anchorage (USA) : IEEE Press, 2007: 1064-1072.
  • 7Becchi M, Crowley P. A hybrid finite automaton for practi- cal deep packet inspection [ C ]//Proceedings of the ACM CoNEXT Conference. New York ( USA ) : Association for Computing Machinery, 2007,1 : 1-12.
  • 8Becchi M, Franklin M, Crowley P. A workload for evalu- ating deep packet inspection architectures [ C ]// IEEE International Symposium on Workload Characterization. Seattle (USA): IEEE Press , 2008: 79-89.
  • 9Yao Tie, Xu Qiang, He Jin. A grouping algorithm based on regular expression similarity for DFA construction [ C ]// IEEE 13th International Conference on Communi- cation Technology ( ICCT ). Jinan ( China ) : IEEE Press, 2011: 671-674.
  • 10He Gang, Wang Yang, Wu Xiaochun. A regular expres- sion grouping algorithm based on partitioning method [ C]//The 3rd IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC). Beijing (China) : IEEE Press, 2012: 271-274.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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