Power-Efficient TCAM partitioning for IP lookups with incremental updates

Authors:
Yeim-Kuan Chang
Affiliations:
Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan R.O.C.
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 3
Cited 2

Fast Updating Algorithms for TCAMs

IEEE Micro
IP-address lookup using LC-tries

IEEE Journal on Selected Areas in Communications
Survey and taxonomy of IP address lookup algorithms

IEEE Network: The Magazine of Global Internetworking

A 2-Level TCAM Architecture for Ranges

IEEE Transactions on Computers
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

Ternary Content-Addressable Memories (TCAMs) provide a fast mechanism for IP lookups and a simple management for route updates. The high power consumption problem can be resolved by providing a TCAM partitioning technique that selectively addresses smaller portions of a TCAM. This paper proposes a 2-level TCAM architecture using prefix comparison rule to partition the routing table into a number of buckets of possibly equal sizes. The 2-level architecture results in a 2-step lookup process. The first step determines which bucket is used to search the input IP. The second step only searches the IP in the determined bucket from the first step. The prefix partitioning algorithm provides an incremental update. Experiments show that the proposed algorithm has lower power consumption than the existing TCAM partitioning algorithms.