公开(公告)号：US20190280976A1

公开(公告)日：2019-09-12

申请号：US15927684

申请日：2018-03-21

申请人： Barefoot Networks, Inc.

发明人： Henry Wang

IPC分类号： H04L12/745 ,  H04L12/743 ,  H04L12/753 ,  H04L12/741 ,  H04L29/06 ,  H04L12/851

摘要： Some embodiments provide a method for configuring unit memories (e.g., unit static random access memories (SRAMs) and ternary content addressable memories (TCAMs) of a network forwarding IC to implement a set of longest prefix matching (LPM) tables. Two different methods of providing a longest prefix match (LPM) operation that minimize the use of ternary content addressable memory (TCAM) are presented. Each method takes advantage of the use of match-action stages and the programmability of the unit memories. An algorithmic LPM embodiment is presented which uses a TCAM index with pointers to SRAM partitions that store subtrees of a routing tree (routing trie structure) and performs subtree rearrangements in the partitions upon the addition of certain routing entries. A chained LPM embodiment, allocates separate exact-match tables for a set of address prefix lengths in, for example, SRAMS, as well as a set of non-exact match tables in, for example, TCAMs.

公开(公告)号：US10511532B2

公开(公告)日：2019-12-17

申请号：US15927684

申请日：2018-03-21

申请人： Barefoot Networks, Inc.

发明人： Henry Wang

IPC分类号： H04L12/745 ,  H04L12/743 ,  H04L12/753 ,  H04L29/06 ,  H04L12/851 ,  H04L12/741

摘要： Some embodiments provide a method for configuring unit memories (e.g., unit static random access memories (SRAMs) and ternary content addressable memories (TCAMs) of a network forwarding IC to implement a set of longest prefix matching (LPM) tables. Two different methods of providing a longest prefix match (LPM) operation that minimize the use of ternary content addressable memory (TCAM) are presented. Each method takes advantage of the use of match-action stages and the programmability of the unit memories. An algorithmic LPM embodiment is presented which uses a TCAM index with pointers to SRAM partitions that store subtrees of a routing tree (routing trie structure) and performs subtree rearrangements in the partitions upon the addition of certain routing entries. A chained LPM embodiment, allocates separate exact-match tables for a set of address prefix lengths in, for example, SRAMS, as well as a set of non-exact match tables in, for example, TCAMs.