Abstract
TCAM Razor consists of the following four basic steps. First, convert a given packet classifier to a reduced decision diagram, which is the canonical representation of the semantics of the given packet classifier. Second, for every nonterminal node in the decision diagram, minimize the number of prefixes associated with its outgoing edges using dynamic programming. Third, generate rules from the decision diagram. Last, remove redundant rules. As an example, running our algorithms on the packet classifier in Table 1.1 will yield the one in Table 1.2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Meiners, C.R., Liu, A.X., Torng, E. (2010). TCAM Razor. In: Hardware Based Packet Classification for High Speed Internet Routers. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6700-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6700-8_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6699-5
Online ISBN: 978-1-4419-6700-8
eBook Packages: EngineeringEngineering (R0)