Efficient location of free spaces in TCAM to improve router performance: Research Articles

Authors:
Weidong Wu;Bingxin Shi;Feng Wang
Affiliations:
Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan City, Hubei Province 430074, People's Republic of China;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan City, Hubei Province 430074, People's Republic of China;Department of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan City, Hubei Province 430074, People's Republic of China
Venue:
International Journal of Communication Systems
Year:
2005

Citing 0
Cited 3

Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables

ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
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
Power-Aware TCAMs for Routing Table Lookup

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A ternary content-addressable memory (TCAM) is a popular hardware device for performing fast IP-address lookup. Because keeping all entries sorted in TCAM, we need move the entries for inserting a new entry. In this paper, we have presented a scheme for minimizing route update overheads in TCAM-based forwarding engines. Our optimizations are based on the hierarchy of prefixes in the routing table. The number of memory movement per update depends on the sequence of the new-inserted prefixes, instead of the initial prefixes in routing table. For the real route update traces, the average number of movements is less than 0.01. Further, when compared to an existing optimization algorithm, in the average case, our algorithm shows a 90% reduction in movement overheads. Copyright © 2005 John Wiley & Sons, Ltd.