Network Link Weight Adjustment for Target Path Inclusion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for changing link weights in networks to reroute traffic through a specific vertex or link not on the shortest path often result in unnecessary edge modifications, disrupting other communication paths and are inefficient in minimizing weight changes.
Innovation Solution
A device and method that determine the minimal set of links and weight modifications required to include a user-definable element in the shortest path by iteratively decrementing and incrementing link weights, ensuring minimal impact on other paths and avoiding edge exclusion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If link weights are changed to reroute traffic through a specific vertex not on the shortest path, then the desired routing change is achieved, but unnecessary edge modifications occur that disrupt other communication paths
Solution Approach 1:
The patent applies parameter changes by systematically modifying link weights (parameters) to achieve the desired routing change. Instead of making arbitrary weight changes, the method calculates precise decrement and increment values for specific links to ensure the target vertex is included in the shortest path while minimizing disruption to other routes. This controlled parameter adjustment resolves the contradiction by achieving routing accuracy without unnecessary edge modifications.
2Adaptability or versatility
If multiple link weights are modified to achieve path changes, then routing flexibility is improved, but implementation time increases
Solution Approach 1:
The patent extracts and identifies the minimal subset of links that need weight modifications to achieve the desired routing change. By analyzing the network graph and determining which specific links contribute most significantly to path changes, the method reduces the number of weight modifications required. This extraction approach maintains routing flexibility while minimizing implementation time by focusing changes only on essential links.
3Reliability
If link weights are set to infinity to exclude edges from the network, then the shortest path is controlled, but useful edges are lost for other communication traffic
Solution Approach 1:
The patent applies parameter changes by using controlled weight adjustments (decrements and increments) on specific links rather than setting weights to infinity. This approach maintains path control by ensuring the target vertex is included in the shortest path while preserving the usability of edges for other communication traffic. The method carefully selects weight change magnitudes to achieve routing objectives without completely excluding useful edges from the network.
Data Source
AI summary
A device and method of minimally incrementing and decrementing the weights of a minimal number of links in a network to cause a link/node that is not in the shortest path in the network to be in the shortest path by determining the shortest path with link/node, identifying links in this path that are not in the shortest path without link/node, decrementing identified links to make the path the shortest path, identifying a link in the shortest path without link/node not in the path with link/node, incrementing the link, redoing these steps to determine a number of links and modifications to links that would cause the link/node to appear in the shortest path, identifying the set of links and modifications with the fewest links, and modifying the network in accordance with the identified set.