Network Path Calculation Order Using Pre-stored Shortest Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional shortest path calculation methods in networks require recalculation after topology changes, leading to increased calculation time, as they do not utilize the common paths between previously calculated and new node pairs effectively.
Innovation Solution
A method and apparatus that store calculated shortest path group information and topology information to determine the calculation order of shortest paths between node pairs, prioritizing paths with the most downstream nodes, allowing for the reuse of common paths to shorten calculation time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If conventional shortest path calculation methods recalculate each shortest path from scratch after topology changes, then calculation completeness is ensured, but calculation time increases significantly
Solution Approach 1:
The patent stores pre-calculated shortest path information and topology information before changes occur. When a topology change happens, the system uses this pre-stored information as a foundation for recalculation, avoiding starting from scratch. This preliminary preparation of path data enables faster adaptation to changes.
Solution Approach 2:
Instead of recalculating all shortest paths uniformly, the patent identifies and processes only the affected paths locally. By determining calculation order based on downstream node counts, the system focuses computational effort on paths that actually need recalculation due to topology changes, leaving unchanged paths intact.
2Loss of time
If the system calculates shortest paths without considering common paths between node pairs, then calculation simplicity is maintained, but calculation time increases due to redundant computations
Solution Approach 1:
The patent changes the parameter used for calculation ordering from simple node pair identification to counting downstream nodes. This parameter change enables the system to identify paths that share common segments, allowing it to leverage previously calculated results and avoid redundant computations while maintaining systematic organization.
3Loss of time
If the system does not utilize calculated shortest paths between other node pairs, then calculation independence is maintained, but calculation time increases due to missed optimization opportunities
Solution Approach 1:
The patent makes the calculated shortest path information serve multiple functions: it acts as both the calculation result for specific node pairs and as reference data for calculating other node pairs. The stored path information becomes a universal resource that can be leveraged across different calculation scenarios, maximizing its utility.
Solution Approach 2:
The system uses feedback from previously calculated shortest paths to improve subsequent calculations. By analyzing the calculation results and identifying common paths, the system adjusts its calculation strategy to reuse valid path segments, creating a feedback loop that continuously optimizes recalculation efficiency.
Data Source
AI summary
A path calculation order determining method executed by a calculating apparatus for calculating a shortest path between a node pair in a network, using information on calculated shortest paths between other node pairs, the method including: a step storing calculated shortest path group information on shortest path groups each including calculated shortest paths from a starting node to one or more terminating nodes except the starting node, and topology information of the network, in a memory medium; and a calculation step of calculating shortest paths, starting from its starting node other than the starting node on the calculated shortest paths and having the most nodes that are located downstream therefrom, and terminating at nodes other than its starting node, using the calculated shortest path group information or the topology information for a path not included in the calculated shortest path group.