DAG Routing Stability in LLNs via Virtual Gain Factor Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current solutions for managing dynamic metric advertisements in Low Power and Lossy Networks (LLNs) lead to cumulative errors, resulting in unstable routing topologies and inefficient rebuilding of Directed Acyclic Graphs (DAGs, especially in deep networks, due to the cumulative effect of small metric changes being smoothed and only advertised when exceeding thresholds.
Innovation Solution
A method where nodes in a DAG receive smoothed path costs with a virtual gain factor (VGF) indicating the difference between smoothed and actual path costs, allowing nodes to compute and advertise a resulting smoothed path cost and cumulative VGF, triggering a rebuild of the DAG when thresholds are surpassed, enabling more efficient management of cumulative errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If dynamic metric values are smoothed and only advertised when exceeding thresholds, then network stability is improved, but cumulative error increases in deep networks
Solution Approach 1:
The patent segments the path cost information into two components: the smoothed path cost (for stability) and the cumulative gain factor (for precision). Each node advertises both its smoothed path cost and its cumulative VGF, allowing receiving nodes to reconstruct more accurate path costs by combining these segmented information elements, thus resolving the contradiction between stability and precision.
Solution Approach 2:
The cumulative virtual gain factor (VGF) acts as an intermediary that bridges the gap between smoothed path costs and actual path costs. By introducing this intermediate value that tracks the cumulative deviation, nodes can compensate for smoothing errors without triggering frequent topology changes, thereby maintaining both stability and accuracy.
2Measurement precision
If the entire DAG is rebuilt manually or upon timer expiration, then routing accuracy is improved, but network traffic and energy consumption increase
Solution Approach 1:
The patent introduces dynamic threshold-based triggering for DAG rebuilding. Instead of periodic or manual rebuilding, the system dynamically monitors the cumulative VGF and triggers rebuilding only when the cumulative error exceeds a threshold. This dynamic approach maintains routing accuracy while avoiding unnecessary rebuilding operations that consume energy and generate traffic.
Solution Approach 2:
The system changes the parameter being monitored from raw metric values to the cumulative virtual gain factor. By tracking changes in the cumulative VGF rather than individual metric fluctuations, the system can determine when rebuilding is actually necessary, reducing unnecessary rebuilding events and associated energy consumption while maintaining routing accuracy.
3Quantity of substance
If new metrics are advertised only when values substantially change, then control traffic is reduced, but path quality deteriorates in deep networks
Solution Approach 1:
The patent segments path cost information into smoothed path costs (advertised frequently for stability) and cumulative VGF values (used to track accuracy degradation). This segmentation allows the system to maintain low control traffic volume while still detecting when path quality has deteriorated enough to warrant rebuilding, thus resolving the contradiction between traffic reduction and path quality maintenance.
Solution Approach 2:
The cumulative VGF provides feedback information about the accuracy degradation caused by metric smoothing. By incorporating this feedback mechanism, nodes can make informed decisions about when to trigger DAG rebuilding based on actual path quality deterioration rather than arbitrary thresholds, maintaining path quality while minimizing control traffic.
Data Source
AI summary
The subject disclosure relates to a method for directing acyclic graph routing and management for Low power and Lossy Networks (LANs). A system may identify a gain factor that indicates a potential gain that can be obtained in link cost from a node in a network represented by a direct acyclic graph (DAG) to the root node of the DAG when an upper node in the DAG changes its routing decision. When the gain factor exceeds a threshold, the node can transmit a DAG rebuild request to other nodes in the DAG. Upon receiving the request, the system may determine whether to satisfy the DAG rebuild request based on the number of requesting nodes. Based on the determination, the system may select a new parent node for the node that receives the request. The DAG rebuild can decrease in link cost from the transmitting node to the root node.