-
公开(公告)号：US11770338B2
公开(公告)日：2023-09-26
申请号：US17410194
申请日：2021-08-24
Applicant: Arista Networks, Inc.
Inventor： Trevor Siemens , Mayukh Saubhasik , Vahab Akbarzadeh
Abstract: Techniques for operating a network device for increasing the logical multi-path size of a hardware forwarding table are provided. In some embodiments, the network device may determine that a number of data points in a first node is greater than a maximum node capacity; generate second nodes; update the first node to refer to the second nodes; distribute the data points among the second nodes; and program a hardware table with the updated first node and the second nodes.
-
公开(公告)号：US11689448B2
公开(公告)日：2023-06-27
申请号：US17563969
申请日：2021-12-28
Applicant: Arista Networks, Inc.
Inventor： Sriram Sellappa , Mayukh Saubhasik , Imtiyaz Mohammad
Abstract: Some embodiments provide techniques for optimized programming of forwarding data in network device hardware. An operating system executing on the network device receives information associated with a network topology of a network(s) to which the network device belongs. Based on this information, the operating system can generate various data structures that facilitate the routing and forwarding of data through the network device. Based on the generated data structures, the operating system may then program hardware resources in the network device in order to implement routing and forwarding operations stored in the data structures. During generation of the data structures, the operating system may perform some operations to optimize the programing of the hardware resources in a manner that reduces the amount of hardware resources that would otherwise be used without such optimizations.
-
公开(公告)号：US20230084395A1
公开(公告)日：2023-03-16
申请号：US17991170
申请日：2022-11-21
Applicant: Arista Networks, Inc.
Inventor： Binglai Niu , Mayukh Saubhasik
Abstract: A method for optimizing network device resources that includes receiving, by an optimizer, first resource utilization data, making a first determination, based on the first resource utilization data, that resource utilization exceeds an upper threshold, starting, based on the first determination, an optimization process, that includes identifying a resource optimization entry of a resource class optimization queue, and initiating optimization of a resource fragment specified by the resource optimization entry. After initiating optimization of the region of the memory, the method additionally includes receiving second resource utilization data, making a second determination, based on the second resource utilization data, that the resource utilization is below a lower threshold, and halting, based on the second determination, the optimization process.
-
公开(公告)号：US20220210006A1
公开(公告)日：2022-06-30
申请号：US17558944
申请日：2021-12-22
Applicant: Arista Networks, Inc.
Inventor： Matthew Carrington-Fair , Mayukh Saubhasik
IPC: H04L41/0654 , H04L45/00 , H04L45/28 , H04L12/46 , H04L45/50 , H04L43/0811
Abstract: In general, embodiments relate to a method for managing traffic flow along a path between network devices. The method includes initiating, by an end-point network device, monitoring of the path, wherein the end-point network device transmits packets to a target network device over the path, detecting after the initiating, by the end-point network device, that at least a portion of the path has failed, wherein the portion of the path that has failed is external to the end-point network device, in response to the detecting, identifying which portions of network device hardware in the source network device need to be updated to redirect the packets from the end-point network device to the target network device to take a second path, and updating the identified portions of the network device hardware.
-
公开(公告)号：US20240396827A1
公开(公告)日：2024-11-28
申请号：US18324886
申请日：2023-05-26
Applicant: Arista Networks, Inc.
Inventor： Sujit Kumar Sah , Trevor Siemens , Mayukh Saubhasik , Jesper Skriver
Abstract: Requests to create entries in a hardware nexthop table can be delayed so that table entry creation rate can be dampened to reduce the occurrence of table overflow under certain transient conditions. When table utilization exceeds a threshold, received creation requests can be buffered instead of being processed right away. When table utilization falls below the threshold, received creation requests can be processed immediately without being buffered. Buffered creation requests can be periodically drained.
-
Patent Agency Ranking
公开(公告)号：US20240031271A1
公开(公告)日：2024-01-25
申请号：US17871664
申请日：2022-07-22
Applicant: Arista Networks, Inc.
Inventor： Mayukh Saubhasik , Nam Anh Tran , Vahab Akbarzadeh
Abstract: A method of operating a network device is provided. The method may include updating a software forwarding table in response to a link between the network device and one or more next hops device being disconnected or connected. The software forwarding table may list next hop devices currently available or connected to the network device for a given destination prefix. The method may include determining whether to update a hardware forwarding table also associated with the given destination prefix depending on whether one or more criteria have been satisfied. The hardware forwarding table may be updated in accordance with a resilient mode or an ordered mode. The resilient mode takes into account history information associated with the hardware forwarding table, whereas the ordered mode does not take into account the history information associated with the hardware forwarding table.
-
公开(公告)号：US20230388221A1
公开(公告)日：2023-11-30
申请号：US18316168
申请日：2023-05-11
Applicant: Arista Networks, Inc.
Inventor： Sriram Sellappa , Mayukh Saubhasik , Imtiyaz Mohammad
Abstract: Some embodiments provide techniques for optimized programming of forwarding data in network device hardware. An operating system executing on the network device receives information associated with a network topology of a network(s) to which the network device belongs. Based on this information, the operating system can generate various data structures that facilitate the routing and forwarding of data through the network device. Based on the generated data structures, the operating system may then program hardware resources in the network device in order to implement routing and forwarding operations stored in the data structures. During generation of the data structures, the operating system may perform some operations to optimize the programing of the hardware resources in a manner that reduces the amount of hardware resources that would otherwise be used without such optimizations.
-
公开(公告)号：US20230246940A1
公开(公告)日：2023-08-03
申请号：US18159623
申请日：2023-01-25
Applicant: Arista Networks, Inc.
Inventor： Emil Maric , Mayukh Saubhasik , Vahab Akbarzadeh , Trevor Siemens
IPC: H04L45/02
CPC classification number: H04L45/02
Abstract: Techniques for operating a network device for sharing resources in a hardware forwarding table. In some embodiments, the network device may generate groups of routes having a common set of next hops; for each group of routes of the generated groups: collect resilient adjacencies associated with routes in the group; assemble pairs of the collected resilient adjacencies; and determine a number of differences between resilient adjacencies in each of the assembled pairs. The network device may further order the assembled pairs based on the number of differences, identify a pair of resilient adjacencies associated with a lowest number of differences; select a resilient adjacency of the identified pair of resilient adjacencies; program one or more routes associated with the selected resilient adjacency, to refer to the other resilient adjacency of the identified pair of resilient adjacencies; and remove an entry associated with the selected resilient adjacency from a forwarding table.
-
公开(公告)号：US11700201B2
公开(公告)日：2023-07-11
申请号：US17385785
申请日：2021-07-26
Applicant: Arista Networks, Inc.
Inventor： Mayukh Saubhasik , Binglai Niu , Ajay Kini
IPC: H04L45/74 , H04L12/66 , H04L45/24 , H04L67/141 , H04L47/70 , H04L67/1087 , H04L45/02 , H04L49/60 , H04L67/2885
CPC classification number: H04L45/74 , H04L12/66 , H04L45/24 , H04L67/141 , H04L45/04 , H04L47/828 , H04L49/602 , H04L67/1089 , H04L67/2885
Abstract: In general, the disclosure relates to a method for forwarding a packet through a multi-tier network by establishing a routing protocol session with network devices in the multi-tier network, obtaining routing protocol information from network devices of the multi-tier network, determining a group using the routing protocol information, generating an ordered group listing using network device identifiers (NDIs) for the network devices in the group, and programming a network device hardware of a network device of the set of network devices of the multi-tier network using the ordered group listing. The group includes a set of the network devices of the multi-tier network.
-
公开(公告)号：US11570083B2
公开(公告)日：2023-01-31
申请号：US17388415
申请日：2021-07-29
Applicant: Arista Networks, Inc.
Inventor： Emil Maric , Mayukh Saubhasik , Vahab Akbarzadeh , Trevor Siemens
IPC: G06F15/173 , H04L45/02
Abstract: Techniques for operating a network device for sharing resources in a hardware forwarding table. In some embodiments, the network device may generate groups of routes having a common set of next hops; for each group of routes of the generated groups: collect resilient adjacencies associated with routes in the group; assemble pairs of the collected resilient adjacencies; and determine a number of differences between resilient adjacencies in each of the assembled pairs. The network device may further order the assembled pairs based on the number of differences, identify a pair of resilient adjacencies associated with a lowest number of differences; select a resilient adjacency of the identified pair of resilient adjacencies; program one or more routes associated with the selected resilient adjacency, to refer to the other resilient adjacency of the identified pair of resilient adjacencies; and remove an entry associated with the selected resilient adjacency from a forwarding table.
-
-
-
-
-
-
-
-
-
Search Results
40
records
(took 0.017 seconds)
