Virtual Node Graph for Constrained Optical Path Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Optical path computation in networks often fails to consider constraints such as the number of network nodes, links, and processing events like regeneration and recoloring, which can affect signal quality and resources, leading to suboptimal path selection.
Innovation Solution
The method involves creating virtual nodes corresponding to permitted events and using a shortest path algorithm to traverse these nodes, forming virtual links only when constraints are not violated, thereby identifying a constrained shortest path between source and destination nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional shortest path algorithms are used based only on weight, then computation is simple and fast, but constraints such as number of nodes, links, and processing events are not considered
Solution Approach 1:
The patent segments the network graph by creating multiple virtual nodes for each physical node, where each virtual node represents a different state regarding constraint satisfaction. This segmentation allows the algorithm to track and enforce constraints while maintaining the shortest path computation framework.
Solution Approach 2:
Virtual nodes act as intermediaries between physical network nodes and the constraint satisfaction requirements. Each virtual node encapsulates information about the current state of constraint usage, mediating between the simple shortest path algorithm and the complex constraint compliance requirements.
2Reliability
If constraints are added to path computation to limit events such as regeneration and recoloring, then signal quality and resource management improve, but device complexity increases
Solution Approach 1:
The patent adds another dimension to the graph representation by creating virtual nodes that incorporate constraint state information. This dimensional transformation allows constraint checking to be integrated into the graph structure itself rather than adding complex checking logic to the path computation algorithm.
Solution Approach 2:
Virtual nodes are created as copies of physical nodes, with each copy representing a different constraint satisfaction state. This copying approach allows the algorithm to explore multiple constraint satisfaction scenarios without modifying the underlying physical network structure or adding complex constraint checking to the core algorithm.
3Reliability
If virtual nodes are created for each node to track permitted events, then constraint compliance is ensured, but memory usage and processing overhead increase
Solution Approach 1:
The patent segments each physical node into multiple virtual nodes, where each virtual node represents a specific state of constraint satisfaction. This segmentation enables precise tracking of constraint usage while maintaining a structured and manageable data representation.
Solution Approach 2:
The patent changes the parameters of the graph representation by adding virtual nodes with different constraint state parameters. This parameter transformation allows the algorithm to work with standard shortest path techniques while implicitly handling constraint compliance through the structure of the virtual nodes themselves.
Data Source
AI summary
Methods and systems are provided for determining a shortest path with a constraint in an optical network. The method includes identifying a permitted number of events defined by the constraint. The method further includes creating virtual nodes for each node in the optical network, the virtual nodes corresponding with the permitted number of events. The method also includes traversing the virtual nodes from a source node to a destination node with a shortest path algorithm, wherein traversing the virtual nodes comprises creating virtual links between the virtual nodes when the constraint is not violated, the virtual link corresponding with a physical link; and identifying a shortest path between the source node and the destination node from the virtual links, the shortest path not violating the constraint.