公开(公告)号：US20220124054A1

公开(公告)日：2022-04-21

申请号：US17503610

申请日：2021-10-18

申请人： HUAWEI TECHNOLOGIES CO., LTD.

发明人： Jie HOU ,  Yuezhong SONG ,  Lei LI ,  Xiaozhong WANG

IPC分类号： H04L12/861 ,  H04L12/745 ,  H04L12/931

摘要： Embodiments of this application provide a packet processing method and apparatus, and a communications device. The method includes the following operations: After obtaining first network cost information of a received first packet, a network device may determine a first queue for the first packet based on the first network cost information, and buffer the first packet to the first queue, where the first network cost information is used to indicate a cost for transmitting the first packet to an egress node. Therefore, the network device considers costs for transmitting packets to the egress node, divides queues based on values of the costs that are indicated, and performs differentiated enqueuing operations on the received packets considering the values of the costs.

公开(公告)号：US20220060419A1

公开(公告)日：2022-02-24

申请号：US17000172

申请日：2020-08-21

申请人： Pensando Systems Inc.

发明人： Ajeer Salil PUDIYAPURA ,  Sarat Babu KAMISETTY ,  Krishna DODDAPANENI

IPC分类号： H04L12/743 ,  H04L12/745 ,  H04L12/753 ,  H04L12/851 ,  H04L12/747 ,  H04L12/879 ,  H04L12/861

摘要： Described are programmable IO devices configured to perform operations. These operations comprise: determining a set of range-based elements for a network; sorting the set of range-based elements according to a global order among the range-based elements; generating an interval table from the sorted range-based elements; generating an interval binary search tree from the interval table; propagating data stored in subtrees of interior stages of the interval binary search tree to subtrees of a last stage of the interval binary search tree such that the interior stages do not comprise data; converting the interval binary search tree to a Pensando Tree; compressing multiple levels of the Pensando Tree into cache-lines; and assembling the cache-lines in the memory unit such that each stage can compute an address of a next-cache line to be fetched by a next stage.

公开(公告)号：US20210392167A1

公开(公告)日：2021-12-16

申请号：US16898020

申请日：2020-06-10

申请人： Arista Networks, Inc.

发明人： Adam James Sweeney

IPC分类号： H04L29/06 ,  H04L12/745 ,  H04L12/743 ,  H04L12/721

摘要： A method for processing network communications, the method including receiving a network packet at a network device and performing at least one lookup for the packet in one or more first lookup tables in which the one or more first lookup tables are programmed to include at least one of an exact match or longest prefix match (LPM) table entry. The method includes obtaining a security source segment and a security destination segment based upon the result of the at least one lookup for the packet in the one or more first lookup tables. The method further includes performing a lookup in a second lookup table based upon the security source segment and security destination segment in which the second lookup table is programmed in a content addressable memory. Based upon the result of the lookup in the second lookup table, processing a forwarding decision for the packet according to the security source segment and security destination segment.

公开(公告)号：US20210377174A1

公开(公告)日：2021-12-02

申请号：US16891035

申请日：2020-06-02

申请人： Cisco Technology, Inc.

发明人： Sameer Gulrajani ,  Swadesh Agrawal

IPC分类号： H04L12/745 ,  H04L12/733 ,  H04L12/707 ,  H04L12/803

摘要： This disclosure describes techniques for managing path counts at a router. The techniques include monitoring available storage space at a router for storing per prefix routes. In an instance where the available storage space at the router may be inadequate to support continued, stable network operations, the techniques include reducing an amount of per prefix routes that are advertised to the router. The techniques may also include withdrawing previously advertised per prefix routes from the router. As such, path count management concepts may help prevent overload of storage space at a router.

公开(公告)号：US11190447B2

公开(公告)日：2021-11-30

申请号：US16875886

申请日：2020-05-15

申请人： ROCKLEY PHOTONICS LIMITED

发明人： Chiang Yeh ,  Nathan Farrington ,  Cyriel Minkenberg

IPC分类号： H04L12/745 ,  H04L12/721 ,  H04L29/06

摘要： A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address. A distributed router includes a plurality of internal network nodes, the plurality of internal network nodes including an ingress node configured to receive a packet, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address for that packet; means for converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and a routing engine configured to route the packet to the local destination address.

公开(公告)号：US11178054B1

公开(公告)日：2021-11-16

申请号：US16548595

申请日：2019-08-22

申请人： Marvell Israel (M.I.S.L) Ltd.

发明人： Ziv Zamsky ,  Ilan Mayer-Wolf ,  Yakov Tokar

IPC分类号： H04L12/745 ,  G06F16/22

摘要： A network device includes a memory configured to store a plurality of entries in respective locations in the memory, the plurality of entries corresponding to a trie data structure for performing a longest prefix match search. The network device also includes: a memory access engine configured to retrieve from a location in the memory, in a single memory lookup operation, i) longest prefix match information for a node corresponding to a network address in a header of a packet, and ii) pointer information that indicates a child node in the trie data structure. The network device also includes: a child node address calculator configured to use i) the longest prefix match information, and ii) the pointer information, to calculate a memory address of another location in the memory corresponding to the child node.

公开(公告)号：US20210344597A1

公开(公告)日：2021-11-04

申请号：US17373240

申请日：2021-07-12

申请人： Arista Networks, Inc.

发明人： Lincoln Travis Dale

IPC分类号： H04L12/745 ,  H04L12/721

摘要： A network device includes a forwarding information base (FIB). The FIB includes a first number of entries and a default entry. The network device includes a routing information base that includes a second number of entries. The network device includes a FIB entry optimizer that ranks a first portion of the second number of entries based on access information of the first number of entries; ranks a second portion of the second number of entries based on access information of the default entry; and updates at least one entry of the FIB based on the ranks of the first portion of the second number of entries and the ranks of the second portion of the second number of entries. The first number of entries is less than the second number of entries.

公开(公告)号：US11165746B2

公开(公告)日：2021-11-02

申请号：US16579208

申请日：2019-09-23

申请人： Arista Networks, Inc.

发明人： Alton Lo ,  Prashant Srinivas ,  Rajesh Semwal ,  Santosh Kumar

IPC分类号： H04L12/18 ,  H04L29/12 ,  H04L12/743 ,  H04L12/46 ,  H04L12/715 ,  H04L12/745

摘要： In one embodiment, a method is provided. The method includes determining that a network device should use an underlay multicast group associated with an overlay multicast group for multicast traffic. The underlay multicast group carries multicast traffic for the overlay multicast group. The overlay multicast group is associated with a virtual private network. The method also includes determining an underlay multicast group address for the underlay multicast group. The overlay multicast group is associated with an overlay multicast group address. A first portion of the underlay multicast group address is a function of the overlay multicast group address. The method further includes forwarding one or more multicast packets to one or more multicast receivers via the underlay multicast group using the underlay multicast group address.

公开(公告)号：US11102111B2

公开(公告)日：2021-08-24

申请号：US16565084

申请日：2019-09-09

申请人： Cisco Technology, Inc.

发明人： Ayas Pani ,  Sanchay Harneja

IPC分类号： H04L12/753 ,  H04L12/24 ,  H04L12/751 ,  H04L12/745 ,  H04L12/26 ,  H04L12/713 ,  H04L12/947 ,  H04L12/931

摘要： Systems, methods, and computer-readable media for validating routing table information in a network. A network assurance appliance may be configured to retrieve routing table information from a plurality of nodes in a network fabric. The routing table information includes path information from at least one source node to at least one destination node. A graph representation of the routing table information is constructed with the at least one destination node as a sink vertex for the graph representation. The network assurance appliance determines, for each leaf node in the network fabric, whether the leaf node can reach the sink vertex based on the graph representation and determines that there is a misconfiguration of the network fabric based on whether each leaf node in the fabric can reach the sink vertex.

公开(公告)号：US10917338B2

公开(公告)日：2021-02-09

申请号：US16294171

申请日：2019-03-06

申请人： Yaoqing Liu ,  Garegin Grigoryan

发明人： Yaoqing Liu ,  Garegin Grigoryan

IPC分类号： H04L12/741 ,  H04L12/753 ,  H04L12/745

摘要： A system and method for building a data structure for determining if multiple routing or forwarding tables yield the same or different forwarding behaviors. VeriTable uses a single tree/trie traversal to quickly check if multiple forwarding tables are forwarding equivalent, yield routing loops, or black holes. VeriTable also uses the Longest Prefix Matching rule for lookups, e.g., checking if route updates in control plane are consistent with the ones in forwarding plane. VeriTable can be applied to network-wide abnormality diagnosis of network problems, such as scalable and efficient forwarding loop detection and avoidance in the data plane of a network. In addition, VeriTable can be extended to handle incremental updates applied to the forwarding tables in a network.