H. Lu (USA)
TCAM, router table, longest-prefix matching, packet forwarding, power-efficient.
Internet routers conduct router-table lookup based on the destination IP address of the incoming packet to decide where to forward the packet. TCAM, which uses paral lelism to achieve lookup in a single cycle, is a simple and efficient solution for router-table lookup. The major draw back of TCAM is its high power consumption. Trie based architecture proposed in. [1] can be used to reduce TCAM power consumption. However, its effectiveness is limited by the size of index TCAM which is always enabled for search. In this paper we develop a simple but effective trie partition algorithm which reduces the index TCAM size by about 63% for IPv4 and 90% for IPv6.
Important Links:
Go Back
