Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
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
V6Gene: A Scalable IPv6 Prefix Generator for Route Lookup Algorithm Benchmark
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding
IEEE Transactions on Computers
Hi-index | 0.01 |
With the rapid development of the Internet applications and the explosion of end users, IP address has been exhausted and routing lookup speed is the bottleneck of router design. In addition TCAM is widely used for implementation fast IP forwarding table lookup. However, the need to maintain a sorted list incremental updates may slow the lookup speed in a TCAM. In this paper, a fast TCAM update scheme is proposed for TCAM-Based IPv6 routing lookup architecture. Based on the characteristic of prefix distribution, we design a TCAM-Based router architecture for IPv6 routing lookup. As simulation result shows more than 90% update do not need any memory movement in updating operation. The worse case is (D-2)/2, where D is the length of chain.