%0 Journal Article
%T Multiple Decision Tree Algorithm for Packet Classification<br>多决策树包分类算法
%A Li Zhen-qiangZhang Sheng-liangMa Yan Zhao Xiao-yu
%A <br>李振强
%A 张圣亮
%A 马严
%A 赵晓宇
%J 电子与信息学报
%D 2008
%I 
%X Multiple dimension packet classification is an enabling function for many Internet applications, such as network security, network monitoring, quality of service, flow routing, etc. It is difficult to develop a packet classification algorithm that is efficient in both space and time. Based on the observation that there are only a few possible values for the protocol field in the classifier, a Multiple Decision Tree (MDT) algorithm is proposed. This algorithm is suitable for both software and hardware implementation, and is applicable for IPv6 in theory. When MDT is implemented with hardware, the multiple tree can be searched in parallel and pipeline can be used to search within a specific tree, thus the search complexity of MDT is O(1). With advantages in preprocessing time, memory consumption, and search time, MDT can be used to improve the widely used HiCuts and HyperCuts algorithms.
%K Packet classification
%K Decision tree
%K Quality of Service (QoS)
%K Flow routing<br>包分类
%K 决策树
%K 服务质量
%K 流路由
%K 多决策树
%K 包分类算法
%K Classification
%K Packet
%K Decision
%K Tree
%K Algorithm
%K 内存占用
%K 预处理
%K HyperCuts
%K 应用
%K 改进
%K 复杂度
%K 流水结构
%K 查找
%K 并行
%K 理论
%K 硬件实现
%K 软件实现
%K 取值
%K 有限
%K 协议类型
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=DA12ADA4A8C6B65F0AD96320DF6F4206&yid=67289AFF6305E306&vid=340AC2BF8E7AB4FD&iid=E158A972A605785F&sid=997CCAFE43D4D200&eid=32491EEEE0A8C927&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=7