A hardware-based longest prefix matching scheme for TCAMs

A hardware-based longest prefix matching scheme for TCAMs
复制标题

基于硬件的 TCAM 最长前缀匹配方案

DOI:
10.1109/iscas.2005.1465343
复制
发表时间:
2005
期刊:
2005 IEEE International Symposium on Circuits and Systems
影响因子:
--
通讯作者:
J. N. Amaral
J. N. Amaral
中科院分区:
--
文献类型:
--
作者:
S. Kasnavi;V. Gaudet;Paul Berube;J. N. Amaral

文献摘要

被引文献

相似文献

三元内容可寻址存储器(TCAM)由于其高速度而成为基于硬件的查找表解决方案的流行设备。然而,TCAM设备存在更新缓慢、高功耗和低密度等问题。为了提高流水线TCAM的效率,提出了一种基于硬件的最长前缀匹配(HLPM)技术。我们的HLPM提供非常简单和快速的表更新,不需要TCAM管理,并且有可能降低TCAM的功耗和面积要求。据报道,与以前设计的tcam相比,匹配条目可节省高达30%的功耗。
Ternary content addressable memory (TCAM) is a popular device for hardware based lookup table solutions due to its high speed. However TCAM devices suffer from slow updates, high power consumption and low density. In this paper, we present a novel hardware-based longest prefix matching (HLPM) technique for pipelined TCAMs to increase TCAM efficiency. Our HLPM provides very simple and fast table updates, with no TCAM management requirements, as well as potentially decreasing the power consumption and area requirements for a TCAM. Up to 30% power savings for matching entries, compared to previously designed TCAMs, is reported.