计算机工程Issue(1)：258-262,5.DOI:10.3969/j.issn.1000-3428.2014.01.055
改进的HyperSplit报文分类算法
Improved HyperSplit Packet Classification Algorithm
摘要
Abstract
In order to solve the problem of too much memory usage in existing work for high speed large volume multi-field packet classification, an improved HyperSplit algorithm is proposed. By analyzing the cause of too much memory usage, the heuristic algorithms are modified and designed to choose the cutting points and dimensions and eliminate redundancy. Rule replication is greatly reduced, redundant rules and nodes are removed, and the decision tree’s structure is optimized. Simulation results demonstrate that compared with the existing work, independent of rule base’s type and characteristic, the algorithm can greatly reduce memory usage without increasing the number of memory accesses and ensure that packets can be processed at wire speed, and when the volume of classifier is 105, the algorithm consumes about 80%memory usage as that of HyperSplit.关键词
报文分类/规则复制/决策树/内存使用量/内存访问/冗余规则/冗余节点Key words
packet classification/rule replication/decision tree/memory usage amount/memory access/redundant rule/redundant node分类
信息技术与安全科学引用本文复制引用
马腾,陈庶樵,张校辉..改进的HyperSplit报文分类算法[J].计算机工程,2014,(1):258-262,5.基金项目
国家“973”计划基金资助项目(2012CB315901,2012CB315906)；国家“863”计划基金资助项目(2011AA01A103)；国家科技支撑计划基金资助项目(2011BAH19B01) （2012CB315901,2012CB315906）
