SD-WAN Route Priority Based on Link SLA Adherence
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Multi-Node High Availability (MNHA) systems in Software-Defined Wide Area Networks (SD-WANs) face challenges in synchronizing Service-level Agreement (SLA) database states across nodes, leading to increased bandwidth consumption and potential disruptions due to unsynchronized route changes, which can impact network performance and user experience.
Innovation Solution
Nodes in the SD-WAN implement a priority-based route computation mechanism that considers adherence to SLA requirements and node preferences, eliminating the need for SLA database state synchronization across nodes, thereby optimizing resource usage and improving route selection based on performance metrics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If nodes synchronize SLA database states across the network, then route consistency is improved, but bandwidth consumption increases and network resources are depleted
Solution Approach 1:
The patent extracts the SLA database state synchronization function from the traditional routing protocol and implements it separately through dedicated SLA database exchange messages. This allows route consistency to be maintained independently without burdening the primary routing protocol bandwidth, resolving the contradiction between route consistency and bandwidth consumption
Solution Approach 2:
The patent introduces an intermediary SLA database exchange mechanism that mediates between route computation and route advertisement. Nodes compute routes locally using their own SLA database states and exchange only the computed route information with preferred neighbors, avoiding direct synchronization of entire SLA databases and reducing bandwidth consumption while maintaining consistency
2Reliability
If nodes exchange route information frequently to maintain consistency, then route reliability is improved, but network congestion increases
Solution Approach 1:
The patent implements dynamic route advertisement where nodes only advertise routes to preferred neighbors based on current SLA compliance status. The preferred neighbor relationship is dynamically adjusted based on link performance measurements, allowing the system to adaptively control route information exchange frequency and reduce unnecessary network traffic while maintaining reliability
Solution Approach 2:
The patent applies local quality by having each node independently compute route priorities based on its local SLA database state and link performance measurements. Instead of global synchronization, each node makes local routing decisions based on local conditions, reducing the need for frequent global route exchanges and minimizing network congestion
3Reliability
If the system monitors link performance continuously, then SLA compliance is improved, but resource consumption increases
Solution Approach 1:
The patent implements periodic link performance monitoring where nodes measure link metrics at regular intervals rather than continuously. This periodic measurement approach maintains SLA compliance detection capability while significantly reducing the resource consumption associated with constant monitoring, resolving the contradiction between reliability and energy use
Data Source
AI summary
Techniques are disclosed for computing a priority of routes advertised by nodes implementing Layer-3 (L3) Multi-Node High Availability (MNHA) for a Software-Defined Wide Area Network (SD-WAN) interconnecting a first network device and a second network device according to link adherence to performance requirements. In one example, a node computes a priority for a route to the second network device based at least in part on a comparison between (1) one or more performance measurements of a link between the node and the second network device and (2) one or more performance requirements for the link. In some examples, the computed priority for the route is further based in part on a preference for the node. The node exports, to the first network device, the route to the second network device, wherein the route comprises data specifying the computed priority for the route.