DPPC-RE: TCAM-based distributed parallel packet classification with range encoding
DPPC-RE: TCAM-based distributed parallel packet classification with range encoding
复制标题
DOI：
10.1109/tc.2006.123
复制
发表时间：
2006-08
影响因子：
3.7
通讯作者：
K. Zheng;Hao Che;Zhijun Wang;B. Liu;Xin Zhang
中科院分区：
文献类型：
--
作者：
K. Zheng;Hao Che;Zhijun Wang;B. Liu;Xin Zhang
数据包分类已经成为许多新兴网络应用程序的关键数据路径功能。一种有趣的方法是使用三值内容可寻址存储器(TCAM)来实现确定性的高速数据包分类性能。然而，除了高成本和高功耗外，由于存储器技术的时钟速率增长缓慢，传统的基于TCAM的单一解决方案总体上难以跟上快速增长的线速。此外，TCAM的存储效率在很大程度上受到支持具有范围或范围匹配的规则的需求的影响。本文提出了一种利用芯片级并行的分布式TCAM方案，大大提高了系统的吞吐量性能。该方案与距离编码方案无缝结合，不仅解决了距离匹配问题，而且保证了均衡的高吞吐量性能。对吞吐量、处理时延和功耗进行了深入的理论分析和实验，实验结果表明，该方案可以获得与OC768线速匹配的可扩展吞吐量性能。研究发现，对于所研究的五个实际分类器，增加的TCAM存储开销相当小
Packet classification has been a critical data path function for many emerging networking applications. An interesting approach is the use of ternary content addressable memory (TCAM) to achieve deterministic, high-speed packet classification performance. However, apart from high cost and power consumption, due to slow growing clock rate for memory technology, in general, the traditional single TCAM-based solution has difficulty to keep up with fast growing line rates. Moreover, the TCAM storage efficiency is largely affected by the need to support rules with ranges or range matching. In this paper, a distributed TCAM scheme that exploits chip-level-parallelism is proposed to greatly improve the throughput performance. This scheme seamlessly integrates with a range encoding scheme which not only solves the range matching problem, but also ensures a balanced high throughput performance. A thorough theoretical worst-case analysis of throughput, processing delay, and power consumption, as well as the experimental results show that the proposed solution can achieve scalable throughput performance matching up to OC768 line rate or higher. The added TCAM storage overhead is found to be reasonably small for the five real-world classifiers studied