一种采用启发式分割点计算的包分类算法.pdfVIP

第 31 卷第7 期 电子与信息学报 Vo1.31No.7 2009 年 7 月 Journal of Electronics Information Technology Jul.2009 一种采用启发式分割点计算的包分类算法 陈兵 潘宇科 T秋林 (南京航空航天大学信息科学与技术学院 南京 210016) 摘 要2 针对区域分割包分类算法存在的规则分布差异较大的缺陷，该文提出一种基于启发式分割点计算的区域分 割包分类算法。首先依据规则集的分布规律进行分割点计算，然后再进行结构化建树。规则检索时间主要包括分割 点匹配时间和分割点内规则的线性查找时间。该算法能够尽量将规则平分到各分割点，减少了规则分布的差异。仿 真实验结果表明该算法降低了规则数增加对算法性能的影响，支持规则集的实时更新. 关键词g 电信网络:包分类:区域分割:分类器 中固分类号: TP393 文献标识码:A 文章编号: 1009-5896(2009)07-1594-06 A Heuristic Lookup Partition AIgorithm 岛r Packet Classification Chen Bing Pang Yu-ke Ding Qiu-lin (Institute olInlormation Science and Technology, Nanjing University 01 Aero 1,lautics and Astronautics, Nanjing 210016 , Ch饥a) Abstract: Regional p町tition p缸如，t classification algorithm is one of the most effective algorithms. To solve the unsymmetric创 distribution problem of regional partition for packet classification , a heuristic lookup partition algorithm is proposed after 8且alysing the character of rules sets. The main r四earch work on the algorithm in this paper includes two p缸ts: the method of lookup partition to ensure the s严nmetrical distribution of rul钮， and the construction of decision tr回based on the partition found. The time cost of this algorithm is composed by the time for lookup partition and the time for line-search in the partition found. The results of simulation show that the algorithm is not sensitive to the increωement of rules , meanwhile it supports the incremental updating on-line. Key words: Telecommunication network; Packet classfication; Regional partition; Classfier 1 引言 立算法的查找树结构，把原规则集分为各个叶子节 包分