Internal Edge Selection for Protected Network Demand Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods struggle to efficiently identify network paths that satisfy communication demands in large data communication networks, particularly in reducing the number of required links to enhance network capacity and reduce operational costs while ensuring link failure protection.
Innovation Solution
A multi-step process involving clique and Steiner graphs is used to identify a subset of internal edges in a network, refining these edges using stream graphs to determine graph paths that satisfy communication demands, thereby configuring the network to provide link failure protection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional methods are used to identify network paths, then link failure protection is provided, but the number of required links increases and network capacity is reduced
Solution Approach 1:
The patent segments the network identification process into multiple phases: initial subset identification using clique graphs, refinement using stream graphs, and final path determination. This segmentation allows efficient identification of necessary links while maintaining failure protection, avoiding the need to provision excessive links as in conventional single-phase methods.
Solution Approach 2:
The patent performs preliminary identification of an initial subset of internal edges using clique graphs before refining the selection. This preliminary action pre-establishes candidate paths that satisfy failure protection requirements, enabling subsequent optimization without compromising reliability.
2Quantity of substance
If the number of links is reduced to increase network capacity, then operational cost decreases, but identifying paths that satisfy demand becomes more difficult
Solution Approach 1:
The patent introduces stream graphs as an intermediary data structure between the network topology and the path identification process. Stream graphs efficiently represent and query the relationships between demands and internal edges, simplifying the identification of valid paths in reduced-link networks while maintaining accuracy.
Solution Approach 2:
The patent replaces complex combinatorial search mechanisms with graph-theoretic approaches using clique graphs and stream graphs. This substitution transforms the path identification problem from an exponentially complex search into a more manageable graph traversal and query problem, reducing computational difficulty.
3Reliability
If comprehensive path identification is performed to ensure failure protection, then reliability is maintained, but computational time increases
Solution Approach 1:
The patent segments the computational process into distinct phases with specific objectives: clique graph construction for initial subset identification, stream graph construction for refinement, and final path determination. This segmentation enables optimized computation at each stage, reducing total computational time while ensuring failure protection is verified.
Solution Approach 2:
The patent performs preliminary computations to construct clique graphs and identify initial subsets of internal edges before the actual path identification. This preliminary action pre-processes the network data into optimized structures, significantly reducing the computational time required for subsequent path queries and failure protection verification.
Data Source
AI summary
Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.