Method and apparatus for table aging in a network switch

    公开(公告)号:US10216780B2

    公开(公告)日:2019-02-26

    申请号:US15675336

    申请日:2017-08-11

    Applicant: Cavium, Inc.

    Abstract: Embodiments of the present invention relate to a centralized table aging module that efficiently and flexibly utilizes an embedded memory resource, and that enables and facilitates separate network controllers. The centralized table aging module performs aging of tables in parallel using the embedded memory resource. The table aging module performs an age marking process and an age refreshing process. The memory resource includes age mark memory and age mask memory. Age marking is applied to the age mark memory. The age mask memory provides per-entry control granularity regarding the aging of table entries.

    Method and apparatus for generating parallel lookup requests utilizing a super key

    公开(公告)号:US10003676B2

    公开(公告)日:2018-06-19

    申请号:US14628058

    申请日:2015-02-20

    Applicant: Cavium, Inc.

    CPC classification number: H04L69/22 G11C15/00 H04L45/60

    Abstract: The invention describes a network lookup engine for generating parallel network lookup requests for input packets, where each packet header is parsed and represented by a programmable parser in a format, namely a token, which is understandable by the engine. Each token can require multiple lookups in parallel in order to speed up the packet processing time. The sizes of lookup keys varies depending on the content of the input token and the protocols programmed for the engine. The engine generates a super key per token, representing all parallel lookup keys wherein the content of each key can be extracted from the super key through an associated profile identification. The network lookup engine is protocol-independent which means the conditions and rules for generating super keys are full programmable so that the engine can be reprogrammed to perform a wide variety of network features and protocols in a software-defined networking (SDN) system.

    Session based packet mirroring in a network ASIC

    公开(公告)号:US09760418B2

    公开(公告)日:2017-09-12

    申请号:US14494229

    申请日:2014-09-23

    Applicant: CAVIUM, INC.

    CPC classification number: G06F11/00 H04L45/16 H04L45/54 H04L49/201

    Abstract: A forwarding pipeline of a forwarding engine includes a mirror bit mask vector with one bit per supported independent mirror session. Each bit in the mirror bit mask vector can be set at any point in the forwarding pipeline when the forwarding engine determines that conditions for a corresponding mirror session are met. At the end of the forwarding pipeline, if any of the bits in the mirror bit mask vector is set, then a packet, the mirror bit mask vector and a pointer to the start of a mirror destination linked list are forwarded to the multicast replication engine. The mirror destination linked list typically defines a rule for mirroring. The multicast replication engine mirrors the packet according to the mirror destination linked list and the mirror bit mask vector.

    Hybrid wildcard match table
    7.
    发明授权

    公开(公告)号:US10116564B2

    公开(公告)日:2018-10-30

    申请号:US14536937

    申请日:2014-11-10

    Applicant: CAVIUM, INC.

    Abstract: Embodiments of the present invention are directed to a wildcard matching solution that uses a combination of static random access memories (SRAMs) and ternary content addressable memories (TCAMs) in a hybrid solution. In particular, the wildcard matching solution uses a plurality of SRAM pools for lookup and a spillover TCAM pool for unresolved hash conflicts.

    METHOD AND SYSTEM FOR RECONFIGURABLE PARALLEL LOOKUPS USING MULTIPLE SHARED MEMORIES

    公开(公告)号:US20180203639A1

    公开(公告)日:2018-07-19

    申请号:US15923851

    申请日:2018-03-16

    Applicant: CAVIUM, INC.

    Abstract: Embodiments of the present invention relate to multiple parallel lookups using a pool of shared memories by proper configuration of interconnection networks. The number of shared memories reserved for each lookup is reconfigurable based on the memory capacity needed by that lookup. The shared memories are grouped into homogeneous tiles. Each lookup is allocated a set of tiles based on the memory capacity needed by that lookup. The tiles allocated for each lookup do not overlap with other lookups such that all lookups can be performed in parallel without collision. Each lookup is reconfigurable to be either hash-based or direct-access. The interconnection networks are programed based on how the tiles are allocated for each lookup.

Patent Agency Ranking