Leaf-Spine Traffic Forwarding Using Policy-Based Next-Hop Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
AI large model networks experience traffic congestion due to periodic fluctuations and high data traffic volume, often resulting in traffic collisions at downstream ports of Spine nodes.
Innovation Solution
A method and apparatus for traffic forwarding that involves receiving routing information from remote Leaf nodes, determining a next-hop list based on routing policy indexes, and generating forwarding entries to ensure that for different Leaf nodes, the same target next-hop corresponds to the same computing power node connected to the same remote Leaf node, and for the same Leaf node, different target next-hops correspond to different computing power nodes, thereby reducing congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If multiple computing power nodes simultaneously send traffic to computing power nodes under the same Leaf node through the same Spine node, then traffic forwarding is simplified, but traffic congestion occurs at the downstream port of the Spine node
Solution Approach 1:
The patent segments the traffic flow by introducing routing policy indexes that divide traffic from different Leaf nodes into separate forwarding paths through different Spine nodes. This segmentation prevents traffic concentration at single Spine node downstream ports, resolving the contradiction between simplified forwarding and traffic congestion.
Solution Approach 2:
The patent applies local quality by assigning different routing policy indexes to different Leaf nodes, causing traffic to be forwarded through different Spine nodes based on the source Leaf node. This localized differentiation in routing quality prevents congestion while maintaining overall system simplicity.
2Ease of manufacture
If traffic is forwarded through the same Spine node for all Leaf nodes, then routing configuration is simplified, but traffic collisions occur at the downstream port
Solution Approach 1:
The patent introduces a new dimension in routing by adding routing policy indexes that create multiple forwarding dimensions. Traffic from different Leaf nodes is routed through different Spine nodes based on these indexes, preventing collisions while maintaining configuration simplicity through standardized routing policies.
Solution Approach 2:
The routing policy index acts as an intermediary that mediates between the simplified routing configuration and the need to avoid traffic collisions. It provides a systematic way to distribute traffic across multiple Spine nodes without complicating the overall routing structure.
3Reliability
If routing policy indexes are introduced to disperse traffic load, then traffic congestion is reduced, but routing information complexity increases
Solution Approach 1:
The patent changes the routing parameter structure by introducing routing policy indexes that modify how routing decisions are made. This parameter change enables traffic dispersion across multiple Spine nodes while maintaining manageable routing information complexity through systematic index assignment and matching rules.
Data Source
Figure 1
Figure 2~3
Figure 4~5
AI summary
Disclosed are a method and an apparatus for traffic forwarding. In a example of the present disclosure, routing information published by a remote leaf node is received. A next-hop list corresponding to a computing power node connected to the remote leaf node is determined based on the received routing information. For any computing power node connected to the remote leaf node, a target next-hop from the next-hop list corresponding to the computing power node is selected based on a routing policy index of the computing power node; a forwarding entry for the computing power node is generated based on a host route of the computing power node and the corresponding target next-hop, and traffic sent to the computing power node is forwarded based on the forwarding entry.