Network Path Selection Using Clique and Stream Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data communication networks struggle to efficiently identify network paths that satisfy diverse link failure protection demands while minimizing the number of required links, especially in large and complex networks, leading to high computational costs and resource inefficiencies.
Innovation Solution
A multi-step process using clique and Steiner graphs to identify a subset of internal edges in a network, refining these edges through stream graphs, and configuring the network to satisfy demands by determining graph paths that utilize these edges, thereby reducing the number of required links and improving network capacity and efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional methods are used to identify network paths satisfying link failure protection demands, then path identification can be performed, but computational time and complexity increase significantly in large networks
Solution Approach 1:
The patent segments the network path identification problem into multiple independent phases: (1) identifying candidate paths using clique graphs, (2) filtering paths using stream graphs, and (3) final path selection. This segmentation allows each phase to handle a specific subset of computations, reducing overall computational time while maintaining reliability requirements.
Solution Approach 2:
The patent performs preliminary actions by pre-identifying candidate paths using clique graphs before final path selection. This preliminary identification narrows down the search space, allowing subsequent filtering operations to be more efficient and reducing total computational time while ensuring path reliability.
2Reliability
If more links are added to satisfy diverse link failure protection demands, then path identification reliability improves, but network capacity and cost efficiency deteriorate
Solution Approach 1:
The patent extracts only the essential links needed to satisfy link failure protection demands by using clique graphs to identify candidate paths and stream graphs to filter redundant links. This extraction process removes unnecessary links from the network while maintaining the required reliability, thereby reducing the total number of links needed.
Solution Approach 2:
The patent changes the approach from considering all possible links to considering only critical links identified through graph-theoretic methods. By transforming the problem into a graph theory problem with specific parameters (clique graphs, stream graphs), the patent identifies minimal link sets that satisfy reliability requirements without unnecessary infrastructure.
3Reliability
If the network uses more internal edges to satisfy demands, then link failure protection is achieved, but network capacity and operational cost increase
Solution Approach 1:
The patent applies partial action by identifying only the necessary internal edges required for link failure protection rather than providing comprehensive protection for all possible failures. The clique graph method identifies minimal edge sets that satisfy protection demands, avoiding excessive infrastructure while maintaining adequate reliability.
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.