Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Hardware-Based Longest Prefix Matching Scheme for TCAMs
 

Summary: A Hardware-Based Longest Prefix Matching
Scheme for TCAMs
Soraya Kasnavi and Vincent C. Gaudet
Department of Electrical and Computer Engineering
University of Alberta
Edmonton, AB, T6G 2V4
Email: kasnavi, vgaudet@ece.ualberta.ca
Paul Berube and Jos┤e Nelson Amaral
Department of Computer Science
University of Alberta
Edmonton, AB, T6G 2E8
Email: berube, amaral@cs.ualberta.ca
Abstract-- Ternary Content Addressable Memory
(TCAM) is a popular device for hardware based lookup
table solutions due to its high speed. However TCAM devices
suffer from slow updates, high power consumption and low
density. In this paper we present a novel Hardware-based
Longest Prefix Matching (HLPM) technique for pipelined
TCAMs to increase TCAM efficiency. Our HLPM provides very
simple and fast table updates, with no TCAM management

  

Source: Amaral, JosÚ Nelson - Department of Computing Science, University of Alberta

 

Collections: Computer Technologies and Information Sciences