Communications Network Service Link Configuration Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Communications networks face challenges in efficiently configuring service links to satisfy demands due to the large number of signal handling devices and pathways, making it difficult to optimize utilization, quality, lifespan, or maintenance considerations.
Innovation Solution
The method involves determining a spanning subset of service links by obtaining permissible decompositions and iteratively updating them to select a decomposition of a first service link, configuring the network to transmit traffic using these links, and repeatedly selecting sets of service links for segments of a path based on pair weights to minimize total weight.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple service links are used to satisfy network demands, then the network can meet quality and capacity requirements, but the number of service links increases leading to higher complexity and cost
Solution Approach 1:
The patent extracts and removes redundant service links from the network configuration. By identifying and eliminating unnecessary links while maintaining the essential service requirements, the system reduces the total number of service links without compromising quality of service or network reliability.
Solution Approach 2:
The patent applies nesting by hierarchically organizing service links and their decompositions. Service links are nested within broader network paths, and decompositions are nested within service link definitions. This hierarchical structure enables systematic optimization by allowing selective retention of essential nested components while removing redundant outer layers.
2Productivity
If comprehensive service link configurations are evaluated to optimize utilization and cost, then better optimization is achieved, but the computational complexity and time required increases
Solution Approach 1:
The patent segments the complex optimization problem into manageable components: service links are decomposed into smaller path segments, and the overall configuration is broken down into individual service link evaluations. This segmentation allows the system to process and optimize each component separately, reducing computational complexity while maintaining overall optimization efficiency.
Solution Approach 2:
The patent applies partial action by evaluating and optimizing only the necessary portions of service link configurations rather than exhaustively analyzing all possible combinations. By focusing computational resources on critical paths and high-impact decompositions, the system achieves satisfactory optimization without the full computational burden of complete enumeration.
3Adaptability or versatility
If service links are decomposed into smaller segments, then flexibility and optimization opportunities increase, but the number of decompositions and configuration options increases complexity
Solution Approach 1:
The patent applies preliminary action by pre-establishing a structured framework for service link decompositions before actual network configuration. By defining valid decomposition patterns and constraints in advance, the system maintains configuration flexibility while avoiding the complexity of ad-hoc decomposition analysis during runtime.
Data Source
AI summary
Systems and methods are disclosed for configuring a communications network. In disclosed embodiments, for a communication network comprising fiber optic cables connected by switches and transceiver-transponders, a graph representing the communication network can be obtained with edges representing the fiber optic cables, and nodes representing the switches and transceiver-transponders. A set of service links can be determined for a path in the communication network based on a set of demands for the path. Each service link can represent data transmission by one of the transceiver-transponders through one or more of the fiber optic cables connected by zero or more of the switches. Sets of service links can be iteratively selected for progressively longer initial segments of the path. When the initial segment comprises the path, the set of service links for the initial segment can be selected as the set of service links for the path.