Spine Node Route Reflector for Leaf Network Segments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large-scale data centers, the number of routes exceeds the capacity of route entries and hardware entries in distributed gateways, leading to insufficient routing capabilities.
Innovation Solution
Implementing a Spine node as a Route Reflector, where Leaf nodes advertise network segment routes to Spine nodes, which then advertise host routes to other Leaf nodes, allowing packet forwarding without the need for Leaf nodes to learn and store all host routes, thereby reducing the load on route entries and hardware entries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If distributed gateway deployment is used where each Leaf node advertises all host routes, then packet forwarding capability is improved, but the scale of route entries and hardware entries becomes insufficient in large-scale data centers
Solution Approach 1:
The patent segments the routing function into two parts: Leaf nodes handle local network segment routing, while Spine nodes handle inter-segment routing. This division allows each node type to maintain a manageable route table size, with Leaf nodes only storing routes for their local segments rather than all hosts in the data center.
Solution Approach 2:
The Spine node acts as an intermediary between Leaf nodes for inter-segment traffic. When a Leaf node receives a packet destined for another network segment, it forwards the packet to the Spine node, which then performs the lookup and forwarding to the destination Leaf node. This eliminates the need for Leaf nodes to store routes to all hosts.
2Loss of information
If Leaf nodes store all host routes in route entries, then complete routing information is available, but hardware entry capacity is exceeded in large-scale deployments
Solution Approach 1:
The patent extracts the inter-segment routing function from Leaf nodes and places it in Spine nodes. Leaf nodes only retain local network segment routes in their hardware entries, while Spine nodes store the complete routing information for inter-segment forwarding. This extraction resolves the hardware entry capacity limitation at Leaf nodes.
Solution Approach 2:
The patent introduces a hierarchical routing dimension: first-level routing at Leaf nodes for local segments, and second-level routing at Spine nodes for inter-segment traffic. This two-dimensional approach allows routing information to be distributed across multiple levels, preventing any single node from requiring excessive hardware entry capacity.
3Ease of manufacture
If distributed gateway uses standard hardware chips, then cost is reduced, but route entry and hardware entry scales are limited
Solution Approach 1:
The patent merges the routing functions of multiple Leaf nodes into the Spine node. The Spine node consolidates inter-segment routing information from all Leaf nodes, performing aggregate routing for traffic between segments. This merging allows standard hardware chips at Leaf nodes to suffice, while the Spine node (which can be more powerful) handles the consolidated routing burden.
Data Source
AI summary
A network segment route and a host route are advertised to a Spine node; the network segment route advertised by the Spine node is learned; when a first packet hits the network segment route, the first packet is sent to a Spine node corresponding to a next hop of the hit network segment routes so that the Spine node sends the first packet to a Leaf node corresponding to a next hop of a host route hit by the first packet.