Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Reducing TCAM Power Consumption and Increasing Throughput
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
A Fast IP Lookup Scheme for Longest-Matching Prefix
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A nonredundant ternary CAM circuit for network search engines
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low-power high-performance NAND match line content addressable memories
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
An IP router determines the next hop for an internet protocol packet by finding the longest prefix match. Ternary CAMs, which allow bit masking of the IP address, are commonly used for this fast search function. In this paper, a CAM that directly determines the longest prefix match to the stored address is described. One of these best matching (IPCAM) entries replaces on average 22 TCAM entries. Overall, the resulting IPCAM array is less than 1/10 the size of the equivalent TCAM and dissipates 93.5% less dynamic power. The design automatically produces an encoded prefix match length that is limited by the prefix mask, so entries do not need to be sorted in prefix mask length order. Simulations of extracted layouts in a bulk CMOS 65-nm foundry process show the proposed IPCAM circuits can operate above 1 GHz