Tenant-Aware Route Advertisement for SD-WAN Route Reflectors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In software-defined wide-area networks (SD-WAN), route reflectors (RRs) face inefficiencies and performance degradation due to the need to process and advertise routing information across multiple tenants, leading to resource waste and prolonged service times, as they currently rely on complex parsing of routing features to determine appropriate network nodes.
Innovation Solution
The method involves using tenant identifiers to simplify the process of determining network nodes within the same tenant for routing information advertisement, allowing for faster route advertisement by correlating routing information with pre-established tenant identifiers, thereby reducing the time required and improving performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If the RR sends routing information to network nodes of all tenants, then all tenants can receive routing information, but network nodes store unnecessary routing information causing resource waste and performance degradation
Solution Approach 1:
The patent segments the routing information distribution process by introducing tenant identifiers to distinguish between different tenants. The RR divides the set of network nodes into tenant-specific groups and only sends routing information to network nodes belonging to the same tenant, thereby eliminating unnecessary routing information storage while maintaining comprehensive coverage for legitimate recipients.
Solution Approach 2:
The patent uses tenant identifiers as intermediary elements that mediate between the RR and network nodes. These identifiers enable the RR to quickly determine which network nodes should receive routing information without complex parsing, serving as a filtering mechanism that reduces processing time while ensuring accurate information delivery.
2Ease of operation
If the RR parses routing features to determine tenant belonging, then routing information can be sent to specific tenant nodes, but the determining manner is complex and takes a long time
Solution Approach 1:
The patent applies preliminary action by pre-establishing tenant identifiers and pre-configuring the RR with tenant-to-network-node mappings. This preliminary setup eliminates the need for complex real-time parsing of routing features, as the RR can directly use pre-stored tenant identifiers to determine target network nodes, thereby simplifying the determination process while maintaining accuracy.
3Loss of energy
If the RR sends routing information only to determined network nodes of specific tenants, then unnecessary routing information is avoided, but the determination process is time-consuming
Solution Approach 1:
The patent uses copying by creating simplified representations of tenant information through tenant identifiers. Instead of copying and parsing complete routing features for each tenant, the RR copies only the essential tenant identifier information that is pre-associated with network nodes, enabling rapid determination and reducing both time and resource consumption while achieving the same filtering effect.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
This application discloses a routing information sending method and apparatus. The method includes: receiving, by a first network node, routing information sent by a second network node, and determining the routing information corresponds to a tenant identifier; and then determining, by the first network node, that a third network node belongs to a tenant corresponding to the tenant identifier, and sending the routing information to the third network node in response to determining that the third network node belongs to the tenant corresponding to the tenant identifier. It can be learned that, in a route advertising process, the first network node may determine the third network node by using the tenant identifier corresponding to the received routing information, in other words, determine a network node that belongs to a same tenant and to which a route needs to be advertised. Implementation is simpler, a time period required for the first network node to advertise the route can be shortened, and performance of the first network node can be improved.