Scalable IP Routing Lookup in Next Generation Network

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, we propose an efficient algorithm to reduce the required size of Ternary contentaddressable memory. The proposed scheme can eliminate 98 percentage of Ternary content-addressable memory entries by adding tiny DRAM. We also address related issues in supporting IPv6 anycasting.

• Type: Conference
• Year: 2003
• Where: ICOIN
• Authors: Chia-Tai Chan, Pi-Chung Wang, Shuo-Cheng Hu, Chung-Liang Lee, Rong-Chang Chen
• Keywords: Fast Routing Lookups, ICOIN 2003, Ternary Content-addressable Memory, Ternary Contentaddressable Memory