(IEE Proceedings Communications,152(2):172-176)An Efficient Entry-Reduction Algorithm for TCAM-based IP Forwarding Engine
(IEE Proceedings Communications,152(2):172-176)An Efficient Entry-Reduction Algorithm for TCAM-based IP Forwarding Engine
复制标题
(IEE Proceedings Communications,152(2):172-176)一种基于 TCAM 的 IP 转发引擎的高效条目减少算法
DOI：
10.1049/ip-com:20041153
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Hung
中科院分区：
文献类型：
--
作者：
Pi;Chia;Rong;Hung
三元内容可寻址存储器已被广泛用于执行快速路由查找。该算法能够在O（1）时间内完成最佳匹配前缀的搜索，而不需要考虑前缀的个数和长度。与基于软件的解决方案相比，三进制内容寻址存储器可以提供持续的吞吐量和简单的系统架构。然而，它也有一些缺点，如条目数量有限，成本和功耗巨大。因此，提出了一种有效的算法来减少所需的三进制内容可寻址存储器的大小。所提出的方案可以消除98%的三进制内容可寻址的内存条目添加相对较少的DRAM，因此，IPv6路由查找是有吸引力的。
Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix searching in O(1) time without considering the number of prefixes and their lengths. As compared to the software-based solutions, the ternary content-addressable memory can offer sustained throughput and simple system architecture. However, it also comes with several shortcomings, such as the limited number of entries, enormous cost and power consumption. Accordingly, an efficient algorithm is proposed to reduce the required size of ternary content-addressable memory. The proposed scheme can eliminate 98% of ternary content-addressable memory entries by adding comparatively little DRAM and, thus, is attractive for IPv6 routing lookup.