K-Shortest Path Calculation in Optical Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing K-shortest path algorithms in optical networks face failures due to unsorted necessarily passed conditions, leading to repeated links and nodes during assembly, which reduces the success rate of wavelength assignment and network reliability.
Innovation Solution
A method involving the calculation of a shortest path tree in the optical network, sorting necessarily passed links and nodes based on distance, and executing segmented calculations to assemble K-shortest paths, thereby avoiding repeated elements and improving assembly success rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If segmented calculation is used with unsorted necessarily passed conditions, then the calculation can proceed with multiple conditions, but repeated links and nodes occur during assembly causing path assembly failure
Solution Approach 1:
The patent applies preliminary action by sorting the necessarily passed conditions according to their distance from the starting node before performing segmented calculation. This preliminary sorting ensures that conditions are processed in the correct sequence, preventing repeated links and nodes during path assembly, thereby resolving the contradiction between handling multiple conditions and maintaining assembly success rate
2Ease of operation
If necessarily passed conditions are processed in random order, then the calculation is simpler to implement, but the distance determination becomes random causing path assembly failures
Solution Approach 1:
The patent changes the parameter of condition processing order from random to sorted by distance. By introducing a sorting criterion based on distance from the starting node, the system maintains ease of implementation while significantly improving path assembly accuracy, eliminating the contradiction between simplicity and precision
3Productivity
If no sorting of necessarily passed conditions is performed, then the calculation process is faster, but repeated elements reduce wavelength assignment success rate
Solution Approach 1:
The patent performs preliminary sorting of necessarily passed conditions by distance before segmented calculation. This single preliminary action prevents repeated elements during path assembly, ensuring both calculation efficiency and high wavelength assignment success rate, thus resolving the contradiction between speed and reliability
Data Source
AI summary
The disclosure discloses a method and a device for calculating K-shortest paths, belonging to the field of a path calculation technology. The method comprises: calculating a shortest path tree of a whole network topological graph of Traffic Engineering (TE) links in current optical network; sorting, on the calculated shortest path tree, necessarily passed links or nodes in an optical path to be built; executing segmented calculation according to the sorted necessarily passed links and nodes, and assembling the K-shortest paths with paths obtained by the segmented calculation. The manner of sorting the necessarily passed nodes and links on the calculated shortest path tree effectively avoids the path assembly failure probability which is caused by the randomness of the necessarily passed nodes and links, futher speeds up the quick determination of path accessibility, effectively improves the path assembly success rate and the path calculation reliability.