IPv6的快速路由查找算法研究

TCAM被广泛用于执行快速路由查找，不管前缀的数量和长度，它能在极短时间内解决最佳前缀问题。与基于软件解决方法相比较，TCAM能提供持续吞吐量和简单系统体系，这对IPv6路由查找来说是很有吸引力的。然而，它也有一些缺点，例如入口数量有限，价格昂贵和能源消耗。因此，本文提出一种有效、能减少所需TCAM的算法，该算法通过增加微DRAM来消除98％的TCAM入口。实验证明，该算法效果良好，可以大大提高IPv6路由查找性能。

RAPID ROUTING LOOKUP ALGORITHM RESEARCH ON IPv6

Ternary content-addressable memory has been widely used to perform fast routing lookups. It is able to accomplish the best matching prefix problem in O (1)time without considering the number of prefixes and its lengths. As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 routing lookup. However, it also comes with several shortcomings, such as the limited number of entries, expansive cost and power consumption. Accordingly, an efficient algorithm is proposed in the paper to reduce the required size of Ternary content-addressable memory. The proposed scheme, which has a good effect, can eliminate 98 percentages of Ternary content-addressable memory entries by adding tiny DRAM.