Delay-Constrained Path Routing via Segmented Metric Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing path routing technologies face challenges in ensuring data delivery within specific time constraints, particularly when primary routes become congested or degraded, necessitating the identification of alternative paths that maintain data delivery within predetermined time frames.
Innovation Solution
A method is introduced to determine delay-constrained paths by analyzing network information, including routing metrics and multiple paths between nodes, to select path segments that satisfy delay constraints, generating a segment identifier list for routing data efficiently through the network.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple paths are calculated based on the first routing metric, then path diversity is improved, but the ability to guarantee delay constraints deteriorates
Solution Approach 1:
The path selection process is segmented into two distinct phases: first calculating multiple candidate paths based on the first routing metric for path diversity, then selecting the optimal path from these candidates based on the second routing metric to guarantee delay constraints. This segmentation allows both path diversity and delay guarantee to be optimized separately at different stages.
Solution Approach 2:
The system performs preliminary calculation of multiple candidate paths using the first routing metric before the actual path selection. This preliminary action creates a diverse set of path options that can then be evaluated against delay constraints, ensuring both adaptability and reliability are achieved through staged processing.
2Device complexity
If a single primary path is used for data transmission, then routing simplicity is improved, but the risk of congestion and degradation increases
Solution Approach 1:
The system dynamically selects paths based on real-time network conditions by evaluating the second routing metric against delay constraints. Instead of using a fixed single path or randomly switching between paths, the system adaptively chooses the optimal path that satisfies delay requirements, balancing routing simplicity with delivery reliability.
3Reliability
If path segments are selected based on the second routing metric from pre-calculated paths, then delay constraint satisfaction is improved, but the computational overhead increases
Solution Approach 1:
The system performs preliminary calculation of multiple candidate paths using the first routing metric, storing these paths for later selection. This preliminary action reduces computational overhead during actual path selection, as the system only needs to evaluate the second routing metric against pre-calculated paths rather than computing all possible paths from scratch.
Data Source
AI summary
An example method may include obtaining network information of a network and determining a second path from a first node of multiple nodes to a second node of the multiple nodes. The network information may include a network topology that may include the multiple nodes and multiple links connecting the multiple nodes. The multiple links may include a first routing metric and a second routing metric. The network information may also include multiple first paths from each node of the multiple nodes to all other nodes of the multiple nodes along the multiple links. The multiple first paths may be determined based on the first routing metric. The determining the second path may include selecting path segments for the second path along the multiple links based on the path segments being included in the multiple first paths based on the second routing metric of the multiple links included in the path segments.