公开(公告)号：US20180287941A1

公开(公告)日：2018-10-04

申请号：US15476638

申请日：2017-03-31

Applicant: Intel Corporation

Inventor： Eliel Louzoun ,  Ben-Zion Friedman ,  Eli Sorin ,  Nir Haber

IPC: H04L12/741 ,  H04L29/06

Abstract: Disclosed is a mechanism for maintaining a single lookup table entry for symmetric/bidirectional flows. Multiple recipes are stored for each flow. A recipe is employed to select address information from an incoming packet header based on the packet's direction. The address information and an index are employed to generate a lookup key to find the single lookup table entry with the pertinent switching information. The recipe further indicates action pointers in the lookup table entry that are specific to direction. The action pointers point to an address in an action table that contains instructions for actions that are applied to the packet during switching based on the packet's direction.

公开(公告)号：US11281648B2

公开(公告)日：2022-03-22

申请号：US15950446

申请日：2018-04-11

Applicant: Intel Corporation

Inventor： Nir Haber ,  Lior Aloni ,  Eli Sorin

IPC: G06F16/00 ,  G06F16/22 ,  H04L45/745 ,  H04L69/22

Abstract: Technologies for flexible tree-based lookups include an network device that receives a network packet. The network device classifies the network packet to determine a packet type and extracts multiple fields from the network packet to generate a field vector. The fields are selected based on the packet type. The field vector includes words that are associated with the fields. The network device builds a tree representation of the field vector. The tree representation includes a leaf node corresponding to each word of the field vector and one or more root nodes. The network device executes an iterative lookup over the tree representation and, if matching, may perform an action associated with the iterative lookup. To execute the lookup, the network device may determine whether a search key for each node exactly matches a search rule, up to a root node. Other embodiments are described and claimed.

公开(公告)号：US11159427B2

公开(公告)日：2021-10-26

申请号：US15476638

申请日：2017-03-31

Applicant: Intel Corporation

Inventor： Eliel Louzoun ,  Ben-Zion Friedman ,  Eli Sorin ,  Nir Haber

IPC: H04L12/741 ,  H04L29/06

Abstract: Disclosed is a mechanism for maintaining a single lookup table entry for symmetric/bidirectional flows. Multiple recipes are stored for each flow. A recipe is employed to select address information from an incoming packet header based on the packet's direction. The address information and an index are employed to generate a lookup key to find the single lookup table entry with the pertinent switching information. The recipe further indicates action pointers in the lookup table entry that are specific to direction. The action pointers point to an address in an action table that contains instructions for actions that are applied to the packet during switching based on the packet's direction.

公开(公告)号：US20190318022A1

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

申请号：US15950446

申请日：2018-04-11

Applicant: Intel Corporation

Inventor： Nir Haber ,  Lior Aloni ,  Eli Sorin

IPC: G06F17/30 ,  H04L29/06 ,  H04L12/741

Abstract: Technologies for flexible tree-based lookups include an network device that receives a network packet. The network device classifies the network packet to determine a packet type and extracts multiple fields from the network packet to generate a field vector. The fields are selected based on the packet type. The field vector includes words that are associated with the fields. The network device builds a tree representation of the field vector. The tree representation includes a leaf node corresponding to each word of the field vector and one or more root nodes. The network device executes an iterative lookup over the tree representation and, if matching, may perform an action associated with the iterative lookup. To execute the lookup, the network device may determine whether a search key for each node exactly matches a search rule, up to a root node. Other embodiments are described and claimed.