检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:CHEN Zheng ZHANG Zhenhua YU Nenghai TANG Xinan
机构地区:[1]Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China [2]Intel Corporationt
出 处:《Chinese Journal of Electronics》2008年第3期529-533,共5页电子学报(英文版)
摘 要:Packet classification is a critical data-plane task for modern routers to support value-added services, especially for those requiring QoS and flow based processing. However, classification at 10Gbps or higher using an algorithmic approach is still challenging. New generation of Network processor unit (NPU) provides unprecedented processing power for network applications, and it opens a new venture to explore thread-level parallelism for attacking networking performance bottlenecks. This paper studies the implementation issues of how an adaptive clas- sification algorithm can be efflciently implemented on a multi-core and multithreaded NPU architecture. Our algorithm combines best traits of Recursive flow classification (RFC) algorithm and bitmap compression technique to achieve deterministic classification performance while keeping the memory growth checked. When mapping such an algorithm onto the Intel IXP network processor, we consider the characteristic of IXP architecture early in the algorithm-design phase to eliminate the potential perfor- mance bottlenecks. The implemented algorithm is highly efflcient and it can run at 10Gbps speed or higher on a real IXP2800 chip.
关 键 词:Packet classification Network processor Recursive flow classification (RFC)
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.137.236