IPv6—the new Internet protocol (2nd ed.)
IPv6—the new Internet protocol (2nd ed.)
Faster IP lookups using controlled prefix expansion
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Scalable high-speed prefix matching
ACM Transactions on Computer Systems (TOCS)
Routing Table Compaction in Ternary CAM
IEEE Micro
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
An associative ternary cache scheme for ip routing
An associative ternary cache scheme for ip routing
Routing Table Partitioning for Speedy Packet Lookups in Scalable Routers
IEEE Transactions on Parallel and Distributed Systems
Cache replacement policies for IP address lookups
CSS '07 Proceedings of the Fifth IASTED International Conference on Circuits, Signals and Systems
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
The Journal of Supercomputing
| Hi-index | 0.00 |
Routing table lookup is an important operation in packet forwarding. This operation has a significant influence on the overall performance of the network processors. Routing tables are usually stored in main memory which has a large access time. Consequently, small fast cache memories are used to improve access time. In this paper, we propose a novel routing table compaction scheme to reduce the number of entries in the routing table. The proposed scheme has three versions. This scheme takes advantage of ternary content addressable memory (TCAM) features. Two or more routing entries are compacted into one using don't care elements in TCAM. A small compacted routing table helps to increase cache hit rate; this in turn provides fast address lookups. We have evaluated this compaction scheme through extensive simulations involving IPv4 and IPv6 routing tables and routing traces. The original routing tables have been compacted over 60% of their original sizes. The average cache hit rate has improved by up to 15% over the original tables. We have also analyzed port errors caused by caching, and developed a new sampling technique to alleviate this problem. The simulations show that sampling is an effective scheme in port error-control without degrading cache performance.