论文标题
MASHUP：通过平铺树将基于TCAM的IP查找到较大的数据库
MashUp: Scaling TCAM-based IP Lookup to Larger Databases by Tiling Trees
论文作者
论文摘要
三元内容可寻址的记忆（TCAM）通常用于实施IP查找，但遭受了高功率和面积成本的困扰。因此，现代芯片中包含的TCAM是有限的，可以支持数据中心和企业中适度的大型数据集，但未能扩展到数百万个前缀的骨干WAN数据库。 IPv6部署也使部署TCAM变得更加困难，因为在128位地址空间中使用的较大前缀。虽然以前提出了算法技术和TCAM的组合，以降低功耗或更新成本（例如Coolcam [32]和Treecam [28]），但我们专注于使用我们称之为MASHUP来降低TCAM位，我们称Mashup可以轻松地在可在现代的Pipellighable Pipeline Pipeline Pipeline chips中实现，例如TOFIGELINE CHIPS，例如TOFOFIRO-TOFOFIRO-3。 Mashup使用了一种新技术，铺平的树木，考虑了TCAM谷物（瓷砖）尺寸。当使用Tofino-3 TCAM晶粒尺寸（44 x 512）应用于公开可用的IPv6数据集时，需要降低TCAM的2倍。此外，如果我们使用一种新技术混合TCAM和SRAM，我们称为节点杂交，Mashup将TCAM位减少4.5倍，而IPv4的TCAM位则降低7.5倍，允许900,000个前缀的宽面积数据库，可以由Tofino-3和类似的芯片支撑
Ternary content addressable memories (TCAMs) are commonly used to implement IP lookup, but suffer from high power and area costs. Thus TCAM included in modern chips is limited and can support moderately large datasets in data centers and enterprises, but fails to scale to backbone WAN databases of millions of prefixes. IPv6 deployment also makes it harder to deploy TCAMs because of the larger prefixes used in the 128-bit address space. While the combination of algorithmic techniques and TCAM has been proposed before for reducing power consumption or update costs(e.g., CoolCAM [32] and TreeCAM [28]), we focus on reducing TCAM bits using a scheme we call MashUp that can easily be implemented in modern reconfigurable pipeline chips such as Tofino-3. MashUp uses a new technique, tiling trees, which takes into account TCAM grain (tile) sizes. When applied to a publicly available IPv6 dataset using Tofino-3 TCAM grain sizes (44 by 512), there was a 2X reduction in TCAM required. Further, if we mix TCAM and SRAM using a new technique we call node hybridization, MashUp decreases TCAM bits by 4.5X for IPv6, and by 7.5X for IPv4, allowing wide area databases of 900,000 prefixes to be supported by Tofino-3 and similar chips
