PATH ESTABLISHMENT METHOD AND DEVICE, AND NETWORK NODE

    公开(公告)号:US20190334814A1

    公开(公告)日:2019-10-31

    申请号:US16311267

    申请日:2017-07-04

    申请人: ZTE Corporation

    摘要: A path establishment method and device, and a network node are provided. The method includes: on a first node in a path from an ingress node to an egress node, a label of a host Forwarding Equivalence Class (FEC) of the egress node is taken as the label of a parasitic FEC of the egress node, and a Multiprotocol Label Switching (MPLS) based Label Switched Path (LSP) corresponding to the parasitic FEC is established. The label is an incoming label, or an outgoing label, or a combination of an incoming label and an outgoing label.

    Hash-based address matching
    25.
    发明授权

    公开(公告)号:US10389633B2

    公开(公告)日:2019-08-20

    申请号:US15918288

    申请日:2018-03-12

    发明人: Naader Hasani

    IPC分类号: H04L12/743 H04L12/745

    摘要: In one embodiment, processing is performed based on the result of a lookup operation that determines a matching hash bucket entry, with each of the entries of the hash table spanning at least two memories. A first portion of the matching hash bucket entry is retrieved from a first random access memory from a first hash bucket stored at a first location identified based on a first particular hash function applied to a hash key. First current information of the hash key is determined to match the first portion. A second portion of the matching hash bucket entry is retrieved from a second random access memory from a second hash bucket stored at a second location identified based on a second particular hash function applied to the hash key. Second current information of the hash key is determined to match the second portion.

    DYNAMIC ALLOCATION OF MEMORY FOR PACKET PROCESSING INSTRUCTION TABLES IN A NETWORK DEVICE

    公开(公告)号:US20190238459A1

    公开(公告)日:2019-08-01

    申请号:US16254732

    申请日:2019-01-23

    摘要: A method for operating a network device, having data storage with selectably modifiable capacity for storing instructional data for a packet processing operation, includes detecting a need for additional storage for the instructional data, allocating an additional memory block without interrupting operation of the network device, associating with the additional memory block an additional address hashing function, different from each of at least one respective previous address hashing function associated with any previously-allocated memory block. Each respective previous address hashing function transforms a look-up key into a respective addressable location in a previously-allocated memory block, and the additional address hashing function transforms the look-up key into an addressable location in the additional memory block. When a block is deallocated, each unit of instructional data is reprocessed through the hashing function of a different block to which the unit of the instructional data will be moved.

    System and method to match vectors using mask and count

    公开(公告)号:US10339043B1

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

    申请号:US15853707

    申请日:2017-12-22

    申请人: MoSys, Inc.

    发明人: Michael J Miller

    摘要: An apparatus, system, and method is described for calculating a composite index into a customizable hybrid address space that is at least partially compressed to locate a longest prefix match (“LPM”) of a prefix string comprised of a plurality of multi-bit strides (“MBSs”). The device comprises: a mask-and-count logic for generating a base index into memory for a first MBS whose addresses are not compressed; a logical-shift apparatus that selectively uses a variable portion of the second MBS to generate an offset index from the given base index per an amount the second MBS addresses were actually compressed; and an add logic that adds the base index to the offset index to form the composite index that locates the LPM using a single access into memory. A compressed vector contains compression information of the second MBS in an information density format greater than a single bit to a single address.

    Dynamic and compressed trie for use in route lookup

    公开(公告)号:US10284472B2

    公开(公告)日:2019-05-07

    申请号:US15414589

    申请日:2017-01-24

    IPC分类号: H04L12/745 H04L12/743

    摘要: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

    Route Searching Method And Apparatus, Allocation Node, Searching Node, And Ingress Node

    公开(公告)号:US20190075053A1

    公开(公告)日:2019-03-07

    申请号:US16180722

    申请日:2018-11-05

    发明人: Jingzhou YU

    IPC分类号: H04L12/745 H04L29/12

    摘要: A route searching method and apparatus, an allocation node, a searching node, and an ingress node are provided. The method includes: receiving, by an allocation node, a destination IP address of a packet sent by an ingress node, where an allocation table on the allocation node includes a match item field and a searching node number field; performing, by the allocation node, matching of the match item field in the allocation table according to the destination IP address in an LPM principle; if the destination IP address successfully matches a first match item field in the allocation table, obtaining, by the allocation node, a physical box number of a first searching node on which routing information of a first prefix subtree corresponding to the first match item field is located; and sending, by the allocation node, the destination IP address to the first searching node.