运用差分演化算法实现包匹配多层核心基的提取  

Extracting kernel basis using differential evolution algorithm for packet matching

作　　者：王则林[1,2] 郝水侠[3] 

机构地区：[1]南通大学杏林学院,江苏南通226000 [2]南通大学计算机科学与技术学院,江苏南通226000 [3]江苏师范大学数学与统计学院,江苏徐州221116

出　　处：《计算机应用》2017年第3期777-781,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(61070008);南通市科技局应用研究项目(BK2014057)~~

摘　　要：针对网络防火墙、路由器等设备中包匹配的速度问题,提出运用差分演化算法实现包匹配多层核心基的提取。该算法运用多层基础基描述包的多层特征,在每层中分别运用差分演化算法进行比特基和实体基的提取,运用平均自信息和平均互信息量衡量基础基选择的优劣。这种方法可以根据规则库实际规模选择提取比特实体基的层数,非常适应规则库的增长。实验结果表明,所提算法在时间效率、空间效率方面相对于已有的递归数据流匹配算法和基于实数编码的差分演化的包匹配算法,综合性能最优。Aiming at the speed of packet matching in network firewall, router and other equipment, a differential evolution algorithm was proposed to extract the multi-layer core base of package matching. The multi-layer foundation was used to describe the multi-layer characteristics of the packet. In each layer, the bit basics and entitative basics were extracted using differential evolution algorithm and average self- information and the average mutual information were used to evaluate the quality of kernel basis. This method was adapt to select the number of layers of the extracted entity base according to the actual size of rule base, which is very suitable for the growth of rule base. The experimental results show that The proposed algorithm is the first known algorithm to be applied to packet matching efficiently. Compared with RFC （ Recursive Flow Classification） algorithm and RDEPM （ Real-based Differential Evolution Packet Matching） algorithm, the performance of the proposed algorithm is superior in terms of time efficiency and space efficiency.

关 键 词：包匹配 差分演化算法 平均自信息 平均互信息 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]