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
Fast Updating Algorithms for TCAMs
IEEE Micro
Routing Table Compaction in Ternary CAM
IEEE Micro
Reducing TCAM Power Consumption and Increasing Throughput
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
IP switching and gigabit routers
IEEE Communications Magazine
Survey and taxonomy of IP address lookup algorithms
IEEE Network: The Magazine of Global Internetworking
Search engine implications for network processor efficiency
IEEE Network: The Magazine of Global Internetworking
An efficient IP lookup architecture with fast update using single-match TCAMs
WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications
Testing comparison and delay faults of TCAMs with asymmetric cells
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Testing random defect and process variation induced comparison faults of TCAMs with asymmetric cells
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hardware-based IP lookup using n-way set associative memory and LPM comparator
SAMOS'06 Proceedings of the 6th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
A low-power ternary content addressable memory with Pai-Sigma matchlines
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
A novel design for IP packet forwarding based on a new ternary content-addressable-memory configuration offers an efficient hardware solution for the longest-prefix matching problem in Internet routers. The architecture has lower update complexity, lower cost, and shorter search latency compared to the conventional TCAM structure.