Optimal In/Out TCAM Encodings of Ranges

Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat

Abstract

Hardware-based packet classification has become an essential component in many networking devices. It often relies on ternary content-addressable memories (TCAMs), which compare the packet header against a set of rules. TCAMs are not well suited to encode range rules. Range rules are often encoded by multiple TCAM entries, and little is known about the smallest number of entries that one needs for a specific range. In this paper, we introduce the In/Out TCAM, a new architecture that combines a regular TCAM together with a modified TCAM. This custom architecture enables independent encoding of each rule in a set of rules. We provide the following theoretical results for the new architecture: 1) We give an upper bound on the worst-case expansion of range rules in one and two dimensions. 2) For extremal ranges, which are 89% of the ranges that occur in practice, we provide an efficient algorithm that computes an optimal encoding. 3) We present a closed-form formula for the average expansion of an extremal range.
BibTeX
@article{rottenstreich2016optimal,
  author = {Ori Rottenstreich and Isaac Keslassy and Avinatan Hassidim and Haim Kaplan and Ely Porat},
  title = {{Optimal In/Out TCAM Encodings of Ranges}},
  journal = {IEEE/ACM Trans. Networking},
  year = {2016},
  url = {https://openreview.net/forum?id=x18bj7N2Hox},
}

Loading related content...

Figure