Abstract: The traditional formalization description of rule in packet classification is improved. On basis of research on rule conversion method, a novel non-match rule conversion algorithm based on sets is proposed. Its performance is compared with other relevant algorithms, and the time and space complexity are also analyzed and simulated. Experimental results show the amount of rules created by this algorithm is far less than others.

Key words: packet classification, formalization, match

摘要： 对传统包分类算法中的规则形式化进行改进，在研究包分类算法中规则转换方法的基础上，提出一种基于集合运算的非匹配规则转换算法，将该算法与其他范围规则转换算法进行性能比较，分析这些算法的时空复杂度，同时进行仿真。实验结果表明，该算法产生的规则数目小于其他算法。

关键词: 包分类, 形式化, 匹配

CLC Number: 

• TP301.6