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.

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.

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.

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.

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.

Abstract: Recovering and reconciling hierarchical forwarding equivalence class information includes storing routing information in a forwarding information base (FIB) corresponding to a first hierarchy of nodes; storing routing information in a routing table separate from the FIB corresponding to a second hierarchy of nodes; and comparing routing information stored for a candidate node in the first hierarchy of nodes with routing information stored for a first plurality of nodes in the second hierarchy of nodes having a height that is the same as a height of the candidate node. Routing information corresponding to the routing information stored for the candidate node is removed from the FIB when the routing information stored for the candidate node does not match any of the routing information stored among the first plurality of nodes.

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.

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.

Abstract: Recovering and reconciling hierarchical forwarding equivalence class information includes storing routing information in a forwarding information base (FIB) corresponding to a first hierarchy of nodes; storing routing information in a routing table separate from the FIB corresponding to a second hierarchy of nodes; and comparing routing information stored for a candidate node in the first hierarchy of nodes with routing information stored for a first plurality of nodes in the second hierarchy of nodes having a height that is the same as a height of the candidate node. Routing information corresponding to the routing information stored for the candidate node is removed from the FIB when the routing information stored for the candidate node does not match any of the routing information stored among the first plurality of nodes.