节点文献
并行层压缩树包分类算法
Packet classification using parallel level compression trie
【摘要】 在层压缩树路由算法思想基础上提出了一种新的硬件包分类算法———并行层压缩树包分类算法.该算法是基于独立存储单元和多域并行处理并在FPGA内部实现的高速网络包分类算法,主要包括单通道并行搜索和多通道综合比较两大部分.仿真结果表明在40 MHz的搜索时钟频率下,该算法能够达到每秒2 M包头的处理速度,其空间性能明显优于其他算法,具有O(d)的时间复杂度(d为域的个数)和O(dN)的空间复杂度(N为规则数).
【Abstract】 Parallel level compression trie packet classification algorithm,which is based on the idea of level compression routing algorithm and uses the independent memory and the parallel processing multi-fields,is one of the most effective hardware algorithms for fast network packet classification.It mainly consists of single-channel parallel search and multi-channel integrated comparison.The results of simulation show that the algorithm can classify about 2 M packet headers per second on 40 MHz search clock with the time complexity O(d) and space complexity O(dN).
【Key words】 packet classification; level compression trie algorithm; time complexity; space complexity; verilogHDL simulation;
- 【文献出处】 中国科学技术大学学报 ,Journal of University of Science and Technology of China , 编辑部邮箱 ,2006年03期
- 【分类号】TN915.01
- 【被引频次】5
- 【下载频次】80