Hierarchical Path Determination in Multi-Layer Communication Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication network path determination methods fail to efficiently find the shortest or cheapest paths through complex networks with multiple layers and nodes, especially when dedicated nodes with special capabilities are involved, as they do not effectively adapt to traffic changes or utilize node-specific capabilities.
Innovation Solution
A method that determines an open path and a reaching path hierarchically, allowing for the composition of a feasible communication path that incorporates dedicated nodes' capabilities, by using a two-step process to establish a route from a source node to a destination node through intermediate nodes, considering constraints like power level and OSNR, and stitching together open and reaching paths to optimize the path based on metrics such as weight and budget.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional path determination methods are used in complex multi-layer networks, then the network can handle basic routing, but it fails to efficiently find the shortest or cheapest paths and cannot effectively utilize dedicated nodes' special capabilities
Solution Approach 1:
The path determination is divided into two independent phases: open path determination and reaching path determination. The open path phase finds paths from source to intermediate nodes without considering destination-specific constraints, while the reaching path phase completes the path from intermediate nodes to destination. This segmentation allows each phase to be optimized independently and enables efficient composition of complete paths through intermediate node capabilities.
Solution Approach 2:
Intermediate nodes serve as mediators between source and destination, with dedicated nodes acting as special intermediaries with enhanced capabilities (amplification, regeneration, wavelength conversion). The two-phase method explicitly leverages these intermediate nodes to compose complete paths, allowing the network to utilize dedicated nodes' special capabilities while maintaining routing efficiency.
2Ease of operation
If the network uses predetermined routing phases, then routing can be simplified, but the network cannot adapt to traffic changes or reconfigure in response to dynamic conditions
Solution Approach 1:
While maintaining a structured two-phase approach for operational simplicity, the method dynamically adapts to traffic changes by allowing different open paths and reaching paths to be selected based on current network conditions. The composition of paths through intermediate nodes enables flexible reconfiguration without requiring complete path recalculation, achieving both simplicity and adaptability.
3Reliability
If the method determines complete paths considering all constraints simultaneously, then path feasibility is ensured, but the computational complexity increases significantly in multi-layer networks
Solution Approach 1:
The complex path determination problem is segmented into two simpler sub-problems: open path determination (source to intermediate nodes) and reaching path determination (intermediate nodes to destination). Each phase considers only the constraints relevant to that phase, significantly reducing computational complexity while ensuring overall path feasibility through the composition of both phases.
Solution Approach 2:
The open path phase performs preliminary path determination from source to intermediate nodes before considering destination-specific constraints. This preliminary action allows the network to pre-establish viable paths to intermediate nodes, which can then be efficiently completed to destinations, reducing the overall computational burden while maintaining feasibility.
Data Source
Figure 1
Figure 2a~2b
Figure 2c~2d
AI summary
It is proposed a method to operate a communication network, wherein a first node (A) is connected via a plurality of intermediate nodes (B-E) with a second node (Z). In a first determination step (222) an open path (224) starting with the first node (A) as a source node is determined. The open path (224) does not comprise the second node (Z) as a destination node. In a second determination step (226) a reaching path (228) starting with one of the intermediate nodes (C) in the open path (224) as a source node is determined. The reaching path (228) comprises the second node (Z) as a destination node.