By Topic

Bit weaving: A non-prefix approach to compressing packet classifiers in TCAMs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Meiners, C.R. ; Dept. of Comput. Sci. & Eng., Michigan State Univ., East Lansing, MI, USA ; Liu, A.X. ; Torng, E.

Ternary Content Addressable Memories (TCAMs) have become the de facto standard in industry for fast packet classification. Unfortunately, TCAMs have limitations of small capacity, high power consumption, high heat generation, and high cost. The well-known range expansion problem exacerbates these limitations as each classifier rule typically has to be converted to multiple TCAM rules. One method for coping with these limitations is to use compression schemes to reduce the number of TCAM rules required to represent a classifier. Unfortunately, all existing compression schemes only produce prefix classifiers. Thus, they all miss the compression opportunities created by non-prefix ternary classifiers.

Published in:

Network Protocols, 2009. ICNP 2009. 17th IEEE International Conference on

Date of Conference:

13-16 Oct. 2009