Network Node Rank Value Rounding for Routing Stability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Routing determination in communication networks often leads to network instability due to frequent changes in Rank values of network nodes, causing route poisoning and excessive overhead in reestablishing routes, even when communication through a node provides a satisfactory path.
Innovation Solution
A method that involves determining a Rank value for a network node by processing the Rank value of its preferred parent node and candidate parent nodes, rounding up the values to the next higher integral Rank, to minimize changes in advertised Rank values and reduce route poisoning.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Rank values are determined based on communication metrics between network nodes, then routing optimization is achieved, but network instability occurs due to frequent Rank changes causing route poisoning
Solution Approach 1:
The patent applies preliminary action by pre-determining a set of candidate parent network nodes before Rank value changes occur. When a Rank change would cause route poisoning, the system has already identified alternative parent nodes that can immediately take over, preventing the poisoning effect before it propagates through the network. This proactive approach resolves the contradiction by preparing remedial actions in advance rather than reacting to instability after it occurs.
Solution Approach 2:
The patent implements feedback mechanisms by continuously monitoring communication metrics and Rank values of network nodes. When a Rank change is detected that would cause route poisoning, the system uses this feedback information to trigger alternative routing paths through candidate parent nodes. This closed-loop feedback system resolves the contradiction by detecting instability conditions and automatically correcting them, thereby maintaining routing stability despite underlying metric fluctuations.
2Reliability
If route reestablishment is performed frequently to address Rank changes, then routing optimality is maintained, but network overhead increases due to excessive route establishment messaging
Solution Approach 1:
The patent applies preliminary action by pre-identifying and caching candidate parent network nodes before they are needed. These candidate nodes are determined in advance based on current network conditions, so when Rank changes occur, the system can immediately switch to pre-validated alternative paths without performing expensive route discovery procedures. This resolves the contradiction by preparing routing alternatives beforehand, eliminating the need for frequent reestablishment messaging while maintaining routing optimality.
Solution Approach 2:
The patent implements beforehand cushioning by maintaining a set of candidate parent nodes that serve as buffer alternatives against Rank-induced route poisoning. These candidate nodes act as a cushion that absorbs the impact of Rank fluctuations, allowing the network to maintain stable routing without frequent reestablishment. This protective mechanism resolves the contradiction by cushioning against the need for excessive route messaging while preserving routing optimality through pre-validated alternatives.
3Speed
If Rank values are updated based on transient metric increases, then routing responsiveness is improved, but route poisoning occurs due to frequent Rank changes
Solution Approach 1:
The patent applies preliminary action by pre-determining candidate parent nodes before transient metric increases cause Rank changes. When a transient increase occurs, the system can immediately switch to a pre-identified candidate parent node, maintaining routing responsiveness without allowing the transient condition to poison the route. This resolves the contradiction by preparing alternative paths in advance, allowing the network to respond quickly to metric changes while avoiding route poisoning through pre-validated alternatives.
Solution Approach 2:
The patent introduces candidate parent nodes as intermediary elements between the primary routing path and the destination. When transient metric increases cause Rank changes, these intermediary candidate nodes provide alternative mediation for route establishment, preventing the transient condition from directly poisoning the primary route. This intermediary mechanism resolves the contradiction by mediating the impact of transient changes, maintaining responsiveness while protecting route stability through alternative mediation paths.
Data Source
AI summary
Techniques are directed to determining a rank value associated with a first network node. An example method includes determining a second network node indicated as being a preferred parent network node for the first network node. A first rank value is processed to determine a second rank value, the first rank value corresponding to a path from the second network node to a destination network node, including rounding up the first rank value in a predetermined manner to at least a second next higher integral rank value than the first rank value, to determine the second rank value. The second rank value is processed with at least a third rank value to determine the rank value associated with the first network node, the third rank value associated with a path from one of a plurality of candidate parent network nodes, for the first network node, to the destination network node.