Fast Updating Algorithms for TCAMs

  • Authors:
  • Devavrat Shah;Pankaj Gupta

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Micro
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.