基于差分演化算法的大规模包匹配研究

摘要

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.%在差分演化算法与传统包匹配算法基础上,提出一种改进包匹配算法.该算法包匹配的时间性能与规则数目存在弱相关性,可处理多维和大规模规则库的包匹配问题.数值分析与实验结果表明,与基于Trie类算法相比,该算法能使数据包有效地进行线速转发,改善包匹配性能.