Reducing Routing Table Size Using Ternary-CAM

Authors:
Huan Liu
Affiliations:
-
Venue:
HOTI '01 Proceedings of the The Ninth Symposium on High Performance Interconnects
Year:
2001

Citing 0
Cited 3

Efficient Multimatch Packet Classification and Lookup with TCAM

IEEE Micro
Power considerations in banked CAMs: a leakage reduction approach

VLSI Design
IP prefix matching with binary and ternary CAMs

CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Ternary Content Addressable Memory (TCAM) has increasingly been used in high speed routers to perform routing lookup function. They allow simultaneous comparison of the key with every index at the same time so that the longest matched prefix could be selected within one memory access, much faster than software based search algorithms. We propose two techniques to compact routing table stored in TCAM. The techniques allow a smaller TCAM to be used to reduce cost, power consumption and thermal dissipation. They could also help routers to scale to larger routing table. Our simulation shows up to 48% size reduction. Fast incremental update algorithm is presented to maintain space saving without recomputing the compacted table after each routing update.