LISP Fabric Traffic Balancing via Dynamic Routing Weights
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing traffic balancing mechanisms in network fabrics fail to effectively redistribute traffic when a path is affected by failures or degradation, leading to unsatisfactory results.
Innovation Solution
The use of network telemetry to dynamically revise routing weights and priorities in a Locator ID Separation Protocol (LISP) fabric, allowing for intelligent and dynamic load balancing by adjusting weights and priorities based on real-time telemetry data, such as latency and packet drops, to optimize traffic routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional static traffic balancing mechanisms are used, then routing simplicity is maintained, but traffic distribution becomes ineffective when network paths are affected by failures or degradation
Solution Approach 1:
The patent implements dynamic routing weights that automatically adjust based on real-time telemetry data from network paths. Instead of static balancing mechanisms, the system continuously monitors path conditions and recalibrates weights to reflect current network state, enabling effective traffic distribution even when paths experience failures or degradation.
Solution Approach 2:
The system incorporates feedback loops where telemetry data from network paths is collected, analyzed, and used to adjust routing weights. This closed-loop control mechanism allows the routing system to respond to actual network conditions, improving traffic distribution effectiveness while maintaining automated operation without excessive complexity.
2Productivity
If dynamic routing adjustments are implemented, then traffic distribution effectiveness improves, but routing complexity and computational overhead increase
Solution Approach 1:
The routing system performs self-adjustment by automatically collecting telemetry data, analyzing path conditions, and modifying routing weights without external intervention. This self-service capability improves routing efficiency while containing complexity within the automated control system, eliminating the need for manual configuration and reducing operational burden.
Solution Approach 2:
The system dynamically changes routing parameters (weights) based on telemetry data to optimize traffic distribution. By focusing changes on specific weight parameters rather than fundamental routing logic, the system improves productivity while limiting complexity growth to manageable parameter adjustments rather than complete routing protocol overhauls.
3Adaptability or versatility
If real-time telemetry data is collected and processed, then routing accuracy and adaptability improve, but data processing time and system resource consumption increase
Solution Approach 1:
The system processes telemetry data selectively, focusing on critical path conditions and key performance indicators rather than analyzing every available data point. This partial action approach maintains high adaptability to network conditions while reducing data processing time and resource consumption by concentrating computational effort on the most impactful parameters.
4Reliability
If multiple paths are monitored and adjusted, then routing reliability improves, but measurement and control complexity increase
Solution Approach 1:
The system introduces intermediary components that aggregate and normalize telemetry data from multiple paths before analysis. This intermediary layer simplifies the measurement and control complexity by standardizing data formats, filtering redundant information, and presenting consolidated path conditions to the routing decision logic, thereby maintaining high reliability without proportionally increasing analysis complexity.
Data Source
AI summary
Techniques for improved routing based on network traffic are provided. Telemetry data relating to a first network node of a plurality of network nodes in a locator ID separation protocol (LISP) fabric is received. A first portion of the telemetry data that relates to a first destination of a plurality of destinations is identified. Further, a first routing weight associated with a first interface of the first network node is revised based on the first portion of the telemetry data, where the first interface is associated with the first destination. The revised first routing weight is published to a second plurality of network nodes in the LISP fabric, wherein the second plurality of network nodes route packets to the first network node based in part on the revised first routing weight.


