Next Hop Groups for Efficient Network Topology Updates

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Traditional mechanisms for updating network devices to reflect changes in network topology are inefficient, leading to significant overhead and potential loss of network traffic.

Innovation Solution

A method for programming network devices that involves selecting a route from the routing information base (RIB), performing next hop resolution to obtain next hop information (NHI), comparing NHI with next hop groups (NHGs), and updating the forwarding information base (FIB) accordingly.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional mechanisms are used to update network devices with topology changes, then routing information can be updated, but significant overhead is generated and network traffic loss occurs during updates

Engineering Contradiction:

Improvenetwork traffic continuityVSAvoidupdate overhead time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-computing and storing next hop groups (NHGs) that contain multiple valid next hop entries before topology changes occur. When a topology change happens, the network device can immediately switch to a pre-computed alternative NHG without performing real-time computation, thus avoiding traffic loss and reducing update time. This is evident in the system's ability to quickly update forwarding information by switching between pre-prepared NHGs.

Inventive Principle:

Principle #10Preliminary action

2Productivity

If traditional routing update mechanisms are implemented, then routing information can be synchronized, but the complexity and overhead of the update process increases

Engineering Contradiction:

Improverouting update efficiencyVSAvoidupdate mechanism complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The patent applies segmentation by dividing the routing information into distinct components: routing information base (RIB), forwarding information base (FIB), and next hop groups (NHGs). Each component has a specific function and can be updated independently. The NHG structure segments multiple next hop entries into groups that can be collectively switched, simplifying the update process. This segmentation allows the system to update only the necessary FIB entries by switching between NHGs rather than rewriting entire routing tables, thereby improving productivity while managing complexity.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent introduces next hop groups (NHGs) as an intermediary structure between the RIB and FIB. The NHG acts as a mediator that pre-organizes multiple valid next hop entries, allowing the FIB to reference these groups rather than storing complete next hop information directly. This intermediary structure simplifies the update mechanism by enabling fast switching between pre-computed NHGs, reducing the complexity of real-time routing calculations during topology changes.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS12267244B2Next hop groups

Publication Date: 2025.04.01 ARISTA NETWORKS INC

AI summary

In general, the invention relates to a method for programming a network device to perform routing of data packets between and/or within networks. More specifically, the method provides a more efficient process for updating the forwarding equivalence class (FEC) table with minimal impacting of the mappings in the forward information base (FIB) of the network device.