Optical Network Path Computation Using Internal Node Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional path computation algorithms in optical networks do not consider the internal components of nodes, leading to inefficiencies and the inclusion of invalid paths, which can significantly increase computation time as the number of possible paths grows.
Innovation Solution
The system analyzes the internal components of nodes and applies elimination rules based on predetermined invalid sequences of internal components to filter out unviable paths during path computation, ensuring only valid paths are considered.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional path computation algorithms are used that treat nodes as single entities without considering internal components, then the computation process is simpler, but the number of invalid paths increases significantly
Solution Approach 1:
The patent segments each node into multiple internal components (e.g., line ports, section ports, channel ports) with specific functions. This segmentation allows the path computation to evaluate paths at a finer granularity, identifying invalid paths that would otherwise be missed when treating nodes as single entities. The segmentation principle directly addresses the contradiction by making the computation more detailed while improving path validity.
Solution Approach 2:
The patent applies preliminary filtering by establishing elimination rules based on invalid sequences of internal components before completing full path computation. By pre-defining which sequences of internal components are invalid (e.g., certain port transition patterns), the system eliminates invalid paths early in the computation process, reducing the number of paths that need full evaluation while maintaining high reliability.
2Reliability
If path computation considers internal components of nodes, then path validity improves, but computation time increases due to the larger number of paths to evaluate
Solution Approach 1:
The patent performs preliminary filtering by establishing elimination rules based on invalid sequences of internal components before completing full path computation. By pre-defining which sequences are invalid and applying these rules early in the computation process, the system eliminates invalid paths before they can propagate through the entire network graph, significantly reducing computation time while maintaining high path validity.
Solution Approach 2:
The patent extracts and removes invalid paths from the computation process by applying elimination rules that identify and discard paths containing invalid sequences of internal components. This extraction principle allows the system to focus computational resources only on valid paths, reducing overall computation time while ensuring high reliability in the results.
3Reliability
If all possible paths through internal components are computed, then complete path coverage is achieved, but storage requirements increase due to the large number of paths
Solution Approach 1:
The patent extracts and removes invalid paths from the computation process by applying elimination rules that identify and discard paths containing invalid sequences of internal components. This extraction principle allows the system to maintain complete coverage of all valid paths while reducing storage requirements by eliminating invalid paths that would otherwise occupy memory resources.
Solution Approach 2:
The patent performs preliminary filtering by establishing elimination rules based on invalid sequences of internal components before completing full path computation. By pre-defining which sequences are invalid and applying these rules early in the computation process, the system eliminates invalid paths before they can propagate through the entire network graph, significantly reducing computation time while maintaining high path validity.
Data Source
AI summary
Path computation systems and methods are provided herein. According to one embodiment, a method includes obtaining topological information representing a topology of at least a portion of a network. The topological information includes one or more nodes and one or more links, each link configured to connect a node with a neighboring node. Each node includes a plurality of internal components and a plurality of connections configured to interconnect the internal components. The method further includes running path computation through the topological information to determine a plurality of paths from a first internal component to a second internal component. Also, the method includes applying elimination rules during the path computation to filter out one or more paths detected as being invalid. The elimination rules are based on one or more predetermined path sequences that include at least two hops involving an unviable sequence of specific types of internal components.