This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Updating Algorithms for TCAMs
January/February 2001 (vol. 21 no. 1)
pp. 36-47
ASCII Text
x 
 
Devavrat Shah, Pankaj Gupta, "Fast Updating Algorithms for TCAMs," IEEE Micro, vol. 21, no. 1, pp. 36-47, January/February, 2001.
 
 
BibTex
x
 
@article{ 10.1109/40.903060,
author = {Devavrat Shah and Pankaj Gupta},
title = {Fast Updating Algorithms for TCAMs},
journal ={IEEE Micro},
volume = {21},
number = {1},
issn = {0272-1732},
year = {2001},
pages = {36-47},
doi = {http://doi.ieeecomputersociety.org/10.1109/40.903060},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - IEEE Micro
TI - Fast Updating Algorithms for TCAMs
IS - 1
SN - 0272-1732
SP36
EP47
EPD - 36-47
A1 - Devavrat Shah,
A1 - Pankaj Gupta,
PY - 2001
VL - 21
JA - IEEE Micro
ER -
 
One popular hardware device for performing fast routing lookups and packet classification is a ternary content-addressable memory (TCAM). We propose two algorithms to manage the TCAM such that incremental update times remain small in the worst case.
Citation:
Devavrat Shah, Pankaj Gupta, "Fast Updating Algorithms for TCAMs," IEEE Micro, vol. 21, no. 1, pp. 36-47, Jan.-Feb. 2001, doi:10.1109/40.903060
Usage of this product signifies your acceptance of the Terms of Use.