K Shortest Paths Algorithm Batch Processing for ASON Route Determination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The K shortest paths (KSP) algorithm in automatic switched optical networks (ASON) faces a contradiction between reducing computation time and satisfying resource matching requirements, as setting K too small may result in insufficient routes, while setting it too large increases computation time.
Innovation Solution
The method involves presetting a smaller number N of routes (1 < N < K) to be calculated in groups, with resource matching performed on each group, stopping calculations if a matching route is found, and continuing if not, to ensure efficient route determination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the value of K is set to be large to ensure sufficient alternative routes for resource matching, then the resource matching requirement is satisfied, but the computation time of the KSP algorithm increases
Solution Approach 1:
The patent segments the K shortest paths calculation into multiple batches, where each batch calculates a subset of paths (e.g., N paths per batch) and performs resource matching on each batch separately. This segmentation allows early termination when a matching route is found, reducing overall computation time while ensuring sufficient alternative routes are evaluated if needed.
Solution Approach 2:
The patent applies partial action by calculating and evaluating only the necessary number of paths required for successful resource matching, rather than always computing all K paths. The system calculates paths in batches and stops when a matching route is found, avoiding unnecessary computation of all K paths when fewer are sufficient.
2Loss of time
If the value of K is set to be small to reduce computation time, then the KSP algorithm executes faster, but the number of alternative routes obtained is insufficient for resource matching
Solution Approach 1:
The patent divides the K path calculation into multiple batches of N paths each, allowing the system to evaluate routes in manageable groups. This segmentation enables the system to achieve sufficient alternative routes for resource matching while controlling computation time through batch processing and early termination when a match is found.
Solution Approach 2:
The patent dynamically adjusts the effective K value based on actual needs. Instead of using a fixed large K, the system uses batch size N and calculates the number of batches required. This parameter change allows flexible control over the total number of paths evaluated, optimizing both computation time and resource matching reliability.
3Reliability
If all K shortest paths are calculated completely before resource matching, then all alternative routes are available for matching, but the route determination process is inefficient
Solution Approach 1:
The patent performs preliminary resource matching on each batch of calculated paths before proceeding to the next batch. This preliminary action allows the system to determine whether a matching route exists in the current batch, enabling early termination and improving efficiency while maintaining completeness through continuous batch evaluation.
Solution Approach 2:
The patent implements feedback by checking whether resource matching succeeds on each batch of paths. Based on this feedback, the system decides whether to continue calculating more paths or terminate early. This feedback mechanism ensures complete route determination when necessary while significantly improving efficiency when a match is found sooner.
Data Source
AI summary
A method and device for determining a route including: presetting the number N of routes, performing a K shortest paths algorithm after a route query request is received, calculating the routes by group according to the number N of the routes, whenever N routes are calculated, outputting the N calculated routes as a group, and assigning resources to the group of routes; and stopping calculating the routes if a route on which resource matching is successful is obtained from the group of routes, and using the route on which the resource matching is successful as the determined route; otherwise, performing the resource matching on the next group of output routes to determine a route; where N is a positive integer and 1<N<K.