Network Routing with Asymmetric Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Determining paths in networks with asymmetric switches is challenging due to the need for explicit degree connectivity definition, which complicates routing processes.
Innovation Solution
Transforming the network graph to account for asymmetric switches by adding virtual links representing defined degree connectivity, allowing for the application of Shared Risk Group disjoint shortest path routing processes, and treating intra-connected switches as asymmetric switches.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If asymmetric switches are used with explicit degree connectivity definition, then routing control and precision are improved, but device complexity and difficulty of determining paths increase
Solution Approach 1:
The patent applies asymmetry by allowing asymmetric switches to have explicitly defined degree connectivity between specific input and output degrees, rather than requiring symmetric connectivity. This enables precise control over which degree pairs can establish connections, improving routing control while maintaining manageable complexity through the transformation process.
Solution Approach 2:
The patent transforms the network graph representation to incorporate asymmetric degree connectivity parameters. By changing how connectivity is represented in the graph structure (adding degree-specific attributes to edges passing through asymmetric switches), the system achieves precise routing control without proportionally increasing operational complexity.
2Measurement precision
If graph transformation is applied to account for asymmetric switches, then path determination accuracy is improved, but processing time and computational complexity increase
Solution Approach 1:
The patent performs preliminary graph transformation before applying the Shared Risk Group disjoint shortest path routing process. By pre-processing the network graph to incorporate asymmetric switch characteristics and degree connectivity constraints, the system achieves accurate path determination while reducing the computational burden during actual routing operations.
Solution Approach 2:
The transformed graph serves as an intermediary representation that captures asymmetric switch behavior without requiring the routing algorithm to directly handle complex asymmetric constraints. This intermediate structure enables accurate path determination while simplifying the computational process.
3Reliability
If Shared Risk Group disjoint shortest path routing is applied to transformed graph, then routing reliability is improved, but device complexity increases
Solution Approach 1:
The patent segments the routing problem by applying Shared Risk Group (SRG) disjoint path computation, which divides the network into risk groups and finds disjoint paths through different groups. This segmentation improves routing reliability by ensuring paths are isolated from common failure points, while the graph transformation framework keeps the overall process manageable.
Data Source
AI summary
According to particular embodiments, determining paths in a network with asymmetric switches includes receiving a graph representing the network. Each asymmetric switch has defined degree connectivity between one or more pairs of degrees of the asymmetric switch. The graph is transformed to yield a transformed graph that accounts for the asymmetric switches. A routing process is applied to the transformed graph to yield one or more paths through the network.