摘要
在差分演化算法与传统包匹配算法基础上,提出一种改进包匹配算法。该算法包匹配的时间性能与规则数目存在弱相关性,可处理多维和大规模规则库的包匹配问题。数值分析与实验结果表明,与基于Trie类算法相比,该算法能使数据包有效地进行线速转发,改善包匹配性能。
This paper proposes a novel algorithm of packets matching by combining improved differential evolutionary algorithm with classic packets matching algorithm.The time performance of the algorithm in packet matching is very weakly correlated with the number of the rules,thus the algorithm is very suitable for solving packet matching,which is multi-dimensional and large-scale problems.Numerical analysis and experimental results show that this new algorithm effectively improves the wire-speed forwarding,compared with the traditional algorithm based on Trie tree.
出处
《计算机工程》
CAS
CSCD
2012年第23期185-189,共5页
Computer Engineering
基金
国家自然科学基金资助项目(61070008)
教育部人文社会科学基金资助项目(11YJC870012)
江西省教育厅科技基金资助项目(GJJ11106)
江西省南昌市科技局基金资助项目(07110076)
关键词
包匹配
差分演化算法
变异系数
线速转发
多维
大规模
packet matching
differential evolutionary algorithm
coefficient of variation
wire-speed forwarding
multi-dimension
large-scale