Shortest Path Routing With Obligatory Constraint Weights
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing K shortest path algorithms for network routing with obligatory constraints suffer from high computational complexity and inefficiency, particularly in large-scale networks, leading to numerous invalid calculations and difficulty in meeting real-time requirements.
Innovation Solution
A method for calculating a shortest path that involves acquiring resource information, calculating service and obligatory constraint weights for topological elements, and using these weights to determine a path that satisfies obligatory constraints, incorporating the Dijkstra algorithm to optimize the process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the K shortest path algorithm is used to calculate shortest paths with obligatory constraints, then the routing can satisfy obligatory constraints (obligatory nodes and links), but the computational complexity increases significantly and calculation efficiency decreases
Solution Approach 1:
The patent segments the routing calculation process into two distinct phases: first calculating the shortest path based on service constraints (bandwidth, delay, etc.), then separately verifying whether this path satisfies obligatory constraints. This segmentation avoids the inefficiency of calculating multiple shortest paths in sequence, as the traditional K shortest path algorithm does, thereby resolving the contradiction between ensuring constraint satisfaction and maintaining calculation efficiency.
Solution Approach 2:
The patent performs preliminary action by pre-calculating the shortest path using service constraint weights before checking obligatory constraints. By establishing the baseline shortest path first and then verifying obligatory node/link inclusion, the method avoids unnecessary recalculation of multiple paths, thus improving productivity while maintaining reliability.
2Reliability
If the traditional shortest path algorithm calculates multiple paths in sequence to find one satisfying obligatory constraints, then obligatory constraints can be satisfied, but numerous invalid calculations occur and time consumption increases
Solution Approach 1:
The patent divides the routing calculation into independent segments: service constraint-based shortest path calculation and obligatory constraint verification. This segmentation eliminates the time-wasting iterative process of calculating multiple shortest paths sequentially, as each segment can be completed independently without requiring backtracking or recalculation.
Solution Approach 2:
The patent performs preliminary verification of obligatory constraints after calculating the shortest path based on service constraints. This preliminary action approach allows the system to quickly determine whether the optimal path satisfies obligatory requirements, avoiding the time loss associated with calculating multiple alternative paths when the first path already meets all requirements.
3Productivity
If service constraints alone are used for routing calculation, then calculation efficiency is maintained, but obligatory constraints (obligatory nodes and links) cannot be guaranteed
Solution Approach 1:
The patent merges two previously separate considerations into a unified routing calculation framework: service constraint optimization and obligatory constraint satisfaction. By integrating both constraint types into the same calculation process using a dual-weight system, the patent achieves both high calculation efficiency and reliable obligatory constraint satisfaction simultaneously.
Solution Approach 2:
The patent employs a composite weighting mechanism that combines service constraint weights and obligatory constraint weights into a comprehensive evaluation system. This composite approach allows the routing calculation to simultaneously optimize for service quality while ensuring obligatory constraints are met, resolving the contradiction between efficiency and reliability.
Data Source
AI summary
A method for calculating a shortest path, a routing acquisition device, a server and a non-transitory computer-readable storage medium are disclosed. The method may include: acquiring resource information for a network according to a received routing request, where the routing request includes a start node, an end node, a service constraint, and an obligatory constraint; calculating service constraint weights for topological elements in the network according to the service constraint, and calculating obligatory constraint weights for the topological elements according to the obligatory constraint and the resource information for the network; and calculating, according to the service constraint weights and the obligatory constraint weights for the topological elements, a shortest path from the start node to the end node that satisfies the obligatory constraint.