Balanced Link-Disjoint Topologies via Directional Ring Marking
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current mechanisms for finding link-disjoint paths in computer networks often generate paths of vastly different lengths, making them impractical for real-world applications, as one path may be excessively long and unbalanced compared to conventional routing algorithms.
Innovation Solution
The approach involves creating balanced link-disjoint topologies by determining shortest looping rings in a network and marking them in specific directions to ensure shared links are marked consistently, resulting in two topologies with identical cost characteristics, allowing for optimal and balanced path selection.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If current mechanisms are used to find link-disjoint paths, then paths are generated that are link-disjoint, but the paths have vastly different lengths and one path may be excessively long
Solution Approach 1:
The patent changes the parameter of path selection by introducing a marking mechanism that assigns directional preferences to links. By modifying how paths are selected (using marked directions rather than simple shortest path algorithms), the system achieves balanced link-disjoint paths where both paths have comparable lengths, resolving the contradiction between reliability and path length
2Length of moving object
If conventional routing algorithms are used, then shorter paths are computed, but the paths are not link-disjoint and share the same fate upon link failure
Solution Approach 1:
The patent segments the network topology by creating two separate marked topologies where links are assigned to different directions. This segmentation ensures that the two computed paths use different sets of links (link-disjoint), while still maintaining reasonable path lengths through the marking mechanism, thus resolving the contradiction between path length and reliability
Data Source
AI summary
In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.