ECMP Path Validation Using Deterministic Entropy Labels
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for validating Equal Cost Multiple Paths (ECMPs) in segment routing networks are inefficient and non-deterministic, often missing failures due to random label selection and are not applicable for end-to-end performance measurement in SRv6 data planes.
Innovation Solution
A deterministic process using a wildcard flow label (entropy label) is employed to validate ECMPs by forwarding test packets to all available next-hops, with intermediate nodes consolidating information for near-instantaneous end-to-end performance measurement and data plane validation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If random label selection is used for ECMP validation, then the validation process is simple to implement, but it is non-deterministic and often misses failures
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing the mapping between entropy labels and ECMP paths before validation. This allows the validation process to deterministically select labels that cover all paths without random selection, ensuring both completeness and reliability while maintaining operational simplicity.
Solution Approach 2:
The patent changes the parameter selection approach from random label selection to deterministic label selection based on pre-computed mappings. By changing how entropy labels are selected (from random to systematic), the validation achieves deterministic coverage of all ECMP paths while maintaining implementation simplicity.
2Ease of manufacture
If traditional validation methods are used, then the implementation is straightforward, but they are not applicable for end-to-end performance measurement in SRv6 data planes
Solution Approach 1:
The patent makes the validation mechanism universal by designing it to work across multiple network protocols and scenarios. The entropy label-based validation approach is adapted to function in both traditional IP networks and SRv6 data planes, enabling end-to-end performance measurement while maintaining ease of implementation through a unified framework.
Solution Approach 2:
The patent adapts the validation mechanism to SRv6 by changing key parameters: using entropy labels instead of traditional MPLS labels, and implementing end-to-end performance measurement capabilities. These parameter changes enable the system to work in SRv6 environments while preserving the simplicity of the original approach.
3Reliability
If comprehensive ECMP validation is performed, then data plane reliability is improved, but validation time and complexity increase
Solution Approach 1:
The patent applies preliminary action by pre-computing the entropy label to ECMP path mappings and storing them in lookup tables before validation execution. This preprocessing step enables rapid validation by eliminating the need for complex real-time computations, thus achieving comprehensive validation with minimal time loss.
Solution Approach 2:
The patent uses copying by creating and storing pre-computed validation data structures (mappings between entropy labels and paths) that can be quickly referenced during validation. Instead of computing paths in real-time, the system copies and reuses pre-calculated information, significantly reducing validation time while maintaining completeness.
Data Source
AI summary
Systems, methods, and computer-readable media are disclosed for validating multiple paths used for routing network traffic in a network. In one aspect, a network controller can identify one or more intermediate nodes on each of multiple paths in a network, wherein the multiple paths begin at a first network node and end at a last network node. The network controller can further generate a data packet with a label at the first network node, forward the test data packet from the first network node, along each of the one or more intermediate nodes, to the last network node, and perform a data plane validation process for validating packet forwarding from the first network node to the last network node based on the label(s) by determining if a number of the multiple paths equals to a number of packets received at the last network node.