Algorithmic TCAM based ternary lookup
AssigneeBarefoot Networks, Inc.
InventorsPatrick Bosshart, Michael G. Ferrara, Jay E. S. Peterson
Life of this patent
Estimating the term…
Loading patent…
AssigneeBarefoot Networks, Inc.
InventorsPatrick Bosshart, Michael G. Ferrara, Jay E. S. Peterson
Estimating the term…
An algorithmic TCAM based ternary lookup method is provided. The method stores entries for ternary lookup into several sub-tables. All entries in each sub-table have a sub-table key that includes the same common portion of the entry. No two sub-tables are associated with the same sub-table key. The method stores the keys in a sub-table keys table in TCAM. Each key has a different priority. The method stores the entries for each sub-table in random access memory. Each entry in a sub-table has a different priority. The method receives a search request to perform a ternary lookup for an input data item. A ternary lookup into the ternary sub-table key table stored in TCAM is performed to retrieve a sub-table index. The method performs a ternary lookup across the entries of the sub-table associated with the retrieved index to identify the highest priority matched entry for the input data item.
A method for forwarding data messages by performing matching operations on a network switch comprising ternary content addressable memory (TCAM) and random access memory (RAM), the method comprising:
A method for performing a service operation on a data message received by a network element comprising ternary content addressable memory (TCAM) and random access memory (RAM), the method comprising:
A network switch for performing a ternary lookup, the network switch comprising:
Dependencies are inferred from the claim text.