Dynamic Routing Topology for Real-Time Delay Traffic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low Power and Lossy Networks (LLNs) face challenges such as lossy links, low bandwidth, and constraints on memory, processing power, and energy, which are not adequately addressed by existing routing protocols like RPL, particularly in scenarios requiring bounded delays and dynamic routing adjustments.
Innovation Solution
A device determines capable nodes to act as common ancestors for source-destination pairs, enabling them to store downward routes and forward traffic optimally, rather than relying solely on the root node, thereby modifying the routing topology dynamically to meet specific delay requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If non-storing mode is used to preserve scalability and reduce routing states on intermediate nodes, then device complexity is reduced, but delay constraints cannot be satisfied due to all traffic traversing the root node
Solution Approach 1:
The patent segments the routing function by identifying specific capable nodes along the path from source to destination and enabling storing mode only at those nodes. This segmentation allows traffic to be forwarded locally at intermediate capable nodes rather than all traffic traversing the root node, thereby reducing delay while maintaining scalability in other parts of the network.
Solution Approach 2:
The patent applies local quality by enabling storing mode selectively at specific capable nodes rather than uniformly across all intermediate nodes. Each capable node is identified based on its ability to store routing states and its position in the network topology. This localized application of storing mode provides delay optimization only where needed, preserving the overall scalability of non-storing mode.
2Loss of time
If storing mode is enabled at intermediate nodes to provide optimal paths and satisfy delay constraints, then delay constraints are satisfied, but device complexity increases due to routing states on intermediate nodes
Solution Approach 1:
The patent applies partial action by enabling storing mode only at specific capable nodes rather than at all intermediate nodes. This selective approach provides just enough routing state storage capability to satisfy delay constraints for critical traffic flows, while avoiding the excessive complexity that would result from enabling storing mode network-wide.
Solution Approach 2:
The patent changes the operational parameter of intermediate nodes from non-storing to storing mode selectively. By dynamically adjusting this parameter at capable nodes based on their ability to store routing states and their position in the topology, the system optimizes delay performance while controlling the increase in device complexity.
3Device complexity
If all traffic is routed through the root node in non-storing mode, then routing states are minimized on intermediate nodes, but routing efficiency deteriorates due to suboptimal paths
Solution Approach 1:
The patent segments the routing function by identifying specific capable nodes and enabling them to store downward routes. This segmentation allows the network to maintain minimal routing states in most intermediate nodes while providing efficient local forwarding at capable nodes, thereby improving routing efficiency without significantly increasing overall device complexity.
Solution Approach 2:
The patent introduces capable nodes as intermediaries between the source and destination. These capable nodes act as mediators that can store routing states and forward traffic locally, improving routing efficiency by providing optimal paths while maintaining the overall non-storing mode architecture that preserves scalability.
4Loss of time
If storing mode is enabled to support bounded delay communication between mesh nodes, then delay constraints are satisfied, but memory and processing requirements increase at intermediate nodes
Solution Approach 1:
The patent applies local quality by enabling storing mode selectively at specific capable nodes that have the necessary memory and processing capabilities. This approach concentrates the memory and processing requirements at nodes that can handle them, while other nodes continue to operate with minimal resources, thereby satisfying delay constraints without uniformly increasing resource requirements across the entire network.
Solution Approach 2:
The patent changes the operational state of capable nodes from non-storing to storing mode, which increases their memory and processing utilization. By selectively applying this parameter change only at nodes that have the capacity to handle the additional requirements, the system achieves bounded delay communication while avoiding unnecessary resource consumption at nodes that cannot support storing mode.
Data Source
AI summary
In one embodiment, a device determines a set of sources and used destinations for traffic in a computer network, where nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG). The device may then also determine a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node, and instructs the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node.