Shortest Minimum Regeneration Path Search in Optical Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In optical communication networks, determining the shortest path between nodes while minimizing optical regenerations is challenging, as existing methods do not effectively account for regenerations, which affect signal latency, quality, and resource utilization.
Innovation Solution
A method is introduced that creates virtual nodes to traverse the network, selecting candidate nodes that do not exceed a maximum permitted weight and do not violate the shortest minimum regeneration path condition, thereby identifying the shortest path with the fewest regenerations using a control system with a processor and memory media storing executable instructions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of moving object
If the shortest path is selected based on cumulative weight only, then path length is minimized, but optical regenerations are not accounted for leading to increased signal latency and reduced signal quality
Solution Approach 1:
The patent extends the traditional shortest path problem from a single-dimensional weight minimization to a multi-dimensional optimization by introducing virtual nodes that encode regeneration state information. Each virtual node represents a specific regeneration count, transforming the path selection from a simple weight-based decision to a state-aware computation that simultaneously optimizes path length and signal quality by minimizing regenerations.
2Reliability
If optical regenerations are accounted for in path computation, then signal quality is improved, but computational complexity increases due to the need to track regeneration states
Solution Approach 1:
The patent segments the network graph by creating multiple virtual nodes for each physical node, where each virtual node represents a specific regeneration state. This segmentation transforms the complex state-tracking problem into a simpler shortest path problem on an expanded graph, where the Dijkstra algorithm can efficiently find the optimal path without requiring complex dynamic programming or state-space search.
Solution Approach 2:
The patent creates virtual copies of physical nodes to represent different regeneration states. Instead of modifying the original graph structure permanently, virtual nodes serve as copies that encode regeneration information, allowing the algorithm to track regeneration states through path selection on the virtual graph while maintaining the underlying physical network structure intact.
3Reliability
If virtual nodes are created to represent regeneration states, then minimum regeneration path is identified, but memory requirements increase to store and traverse the expanded virtual node structure
Solution Approach 1:
The patent employs dynamic node creation during the Dijkstra algorithm execution, where virtual nodes are created on-demand based on the current search state rather than pre-generating all possible virtual nodes. This dynamic approach reduces memory usage by only storing and processing the subset of virtual nodes that are relevant to finding the shortest minimum regeneration path from the source to destination.
Data Source
AI summary
Methods and systems are provided for determining a shortest minimum regeneration path in an optical network. The method includes creating a virtual node at a source node, the source node communicatively coupled to a destination node through a plurality of nodes and links. The method includes traversing the virtual nodes, wherein traversing the virtual nodes comprises selecting an unvisited virtual node at a node; identifying a candidate virtual node from the unvisited virtual node; determining whether the candidate virtual node exceeds a maximum permitted weight; determining whether the candidate virtual node violates a shortest minimum regeneration path condition; and creating the new virtual node from the candidate virtual node if the candidate virtual node does not exceed the maximum permitted weight and if the candidate virtual node does not violate the shortest minimum regeneration path condition.