计算机科学 ›› 2014, Vol. 41 ›› Issue (5): 164-167.doi: 10.11896/j.issn.1002-137X.2014.05.034

• 信息安全 • 上一篇    下一篇

基于概率分布自适应的化学反应的元启发式优化算法运用于包匹配

王则林,吴志健,尹兰,邓长寿   

  1. 武汉大学计算机学院 武汉430072;武汉大学计算机学院 武汉430072;武汉大学计算机学院 武汉430072;九江学院信息科学与技术学院 九江330005
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(61070008,61364025),教育部人文社科基金(12YJCZH274),贵州省科学技术基金(黔科合J字LKS[2012]37)资助

Packet Matching Using Self-adaptive Chemical-reaction-inspired Metaheuristic for Optimization with Probability Distribution

WANG Ze-lin,WU Zhi-jian,YIN Lan and DENG Chang-shou   

  • Online:2018-11-14 Published:2018-11-14

摘要: 包匹配是防火墙、路由器等设备中重要的研究焦点,它的速度直接影响着设备的性能。根据当前群的样本信息,把信息熵和直方图的理念引入当前群的信息统计,进而运用这些信息去动态调整化学反应的元启发式算法的相关参数。首次从当前群样本的角度,而不是假设全体样本的分布去分析问题。从实验结果看,其达到了很好的预期效果。基于化学反应的元启发式智能算法由于参数的动态调整,包匹配的规模和性能之间的联系更弱,从而使此智能算法更适合包匹配。

关键词: 包匹配,信息熵,直方图

Abstract: Packet matching is the research focus of firewall and router devices.Its speed influences directly device performances.According to the sample informations of population currently,this paper drawed information entropy and histogram into information statistics of population currently,and used these statistics informations to adjust dynamicaly relevant parameters of optimization algorithm of Chemical-reaction-inspired metaheuristic.This paper,for the first time,analyzed problem from the sample of population currently,instead of assuming what is the distribution of all sample.From the experimental results,the algorithm proposed by this paper gets good desired effects.For dynamic adjustment parameters of intelligence algorithm of Chemical-reaction-inspired metaheuristic,the relation of scale and performance of packet matching is more loose.And the intelligent algorithm proposed is more suitable for packet matching.

Key words: Patch matching,Information entropy,Histogram

[1] Warkhede P,Suri S,Varghese G.fast packet classification fortwo-dimensional conflict-free filters[C]∥Proceedings of IEEE,INFOCOM,Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies.Alaska:IEEEE,2001:1434-1443
[2] Gupta P,McKeown N.Algorithms for packet classification [J].IEEE Network,2001,15(2):24-32
[3] Srinivasan V,Varghese G,Suri S,et al.Fast and scalable layer four switching[C]∥Computer Communication Review.Vancouver:ACM SIGCOMM,1998:191-202[5]Buddhikot M M,Suri S,Waldvogel M.Space decompositiontechniques for fast layer-4switching[C]∥Proc of Conf On Protocols for High speed Networks.Salem:IEEE,1999:25-41
[4] Feldman A,Muthukrishnan S.Tradeoffs for packet classification[C]∥Proceedings of INFOCOMM,March.Aviv,Israel:IEEE,2000:1193-1202
[5] Buddhikot M M,Suri S,Waldvogel M.Space decompositiontechniques for fast layer-4switching[C]∥Proc of Conf On Protocols for High speed Networks.Salem:IEEE,1999:25-41[4]Feldman A,Muthukrishnan S.Tradeoffs for packet classification[C]∥Proceedings of INFOCOMM,March.Aviv,Israel:IEEE,2000:1193-1202[5]Gupta P,McKeown N.Packet classification using hierarchicalintelligent cuttings[J].IEEE Micro,2000,20(1):34-41
[6] Singh S,Baboescu F,Varghese G,et al.Packet classification using multi-dimensional cutting[C]∥Proceedings of The 2003Conference on Applications,technologies,Architectures,and Protocols for Computer Communications.Karlsruhe:ACM SIGCOMM,2003:213-224
[7] Gupta P,Mckeown N.Packet classification on multiple fields[C]∥Proc SIGCOMM,Computer Communication Review.Massachusetts:ACM SIGCOMM,1999:147-160
[8] van Lunteren J,Engbersen A P J.Multi-field packet classification using ternary CAM[J].Electronics Letters,2002,38(1):21-23
[9] 李维,刘斌,郗颖,等.基于多域并行编码的高速IPV6流分类[J].电子学报,2007,5(5):976-981
[10] Sreelaja N K,Pai G A V.Ant colony optimization based approach for efficient packet filtering in firewall[J].Applied Soft Computing,2010,10(4):1222-1236
[11] Wang Ze-lin,Wu Zhi-jian,Zhang Bu-zhong.Packet matching algorithm based on improving differential evolution[J].Wuhan University journal of natural sciences,2012,7(5):447-453
[12] 王则林,吴志健.IPV6环境下的高维大规模包匹配算法[J].电子学报,2013,41(11):2181-2186
[13] Brest J,Member.IEEE.Self-Adapting Control Parameters inDifferential Evolution:A Comparative Study on Numerical Benchmark Problems[J].IEEE Transactions on Evoloutionary Computation,2006,10(6):646-657
[14] Yang Z,He J,Yao X.Making a Difference to Differential Evolution,in Advances in Metaheuristics for Hard Optimization[C]∥New York:Springer-Verlag,2007:415-432
[15] Wang C M,Huang Y F.Self-adaptive harmony search algorithm for optimization[J].Expert Syst Appl,2010,37(4):2826-2837
[16] Bingul Z,Sekmen A,Zein-Sabatto S.Adaptive genetic algo-rithms applied to dynamic multi-objective problems[C]∥ Dagli C H,Buczak A L,Ghosh J,eds. Proc.Artificial Neural Networks Engineering Conf.,Newyork,2000:273-278
[17] Lam A Y S,Li V O K.Chemical-reaction-inspired metaheuristic for optimization[J].IEEE Transactions on Evolutionary Computation,2010,4(3):381-339

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!