一种新的高维报文分类算法———无相交树算法-NJCERT.PDFVIP

第 26 卷 　第 11 期 计 　　算 　　机 　　学 　　报 Vol. 26 No. 11 2003 年 11 月 CHINESE JOURNAL OF COMPUTERS Nov. 2003 　 一种新的高维报文分类算法 ———无相交树算法 陆　晟　　龚　俭 ( 东南大学计算机科学与工程系　南京 210096) 摘 　要 　报文分类是网络交换设备的基础操作之一 ,它会在很大程度上影响相关硬件设备和软件系统的功能和性 能. 目前存在大量的报文分类算法,但大多数都是针对低维分类问题. 针对网络管理和网络入侵检测等应用需求的 日益增长,该文提出了一种新的高维报文分类算法 NI Trie. 该算法具有其它报文分类算法所不具备的强表述支持 能力和低时间复杂度并存的特点 ,其期望时间复杂度和期望空间复杂度均达到了同类分类算法的最优或接近最 优. 它具备较强的软硬件通用能力 ,可适用于较广的应用领域 ,实际应用性能良好. 关键词 　报文分类 ;分类算法 ; 网络;高速 ;强表达能力 ;无相交树 中图法分类号 TP393 A MultiDimension Packet Classification Algorithm :NONIntersection Trie LU Sheng 　GONGJian ( Department of Computer Science and Engineering , Southeast University , Nanjing 210096) Abstract 　Packet classification is a fundamental operation performed in networking equipment such as switch ers and routers. The ability of packet classification algorithm would definitely effect the function and perfor mance of such hardware equipment. There are many packet classification algorithms existed , but most of them are focusing on low dimension classification. With the booming of the requirement of network manage and net work intrusion detection , a new high dimension packet classification algorithm is given in the paper , named as NI Trie. The algorithm has an important feature that it owns both high rule complexity and low time complexity , which other packet classification algorithms do not possess. Compared with the same type of classification algo rithms , the expected time complexity and expected storage complexity of NI