Dynamic Address Assignment for LLN Routing Table Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low power and Lossy Networks (LLNs) face challenges in managing large routing tables and memory utilization due to frequent topology changes and fragmented address spaces, leading to adverse network performance and resource constraints.
Innovation Solution
A dynamic address assignment mechanism that monitors routing topology changes and triggers address reconfiguration based on memory utilization, routing table size, and fragmentation, allowing nodes to consolidate addresses and reduce the size of routing tables through address aggregation, thereby improving network scalability and resource efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If static address assignment is used in LLNs, then address configuration is simple, but routing tables become large and memory utilization increases due to fragmented address spaces
Solution Approach 1:
The patent implements dynamic address assignment where child nodes receive address prefixes from parent nodes based on current network topology. This allows the addressing scheme to adapt automatically to topology changes, enabling route aggregation and reducing routing table sizes without requiring complex manual reconfiguration.
Solution Approach 2:
The system changes address assignment parameters dynamically based on network conditions. Parent nodes assign address prefixes to child nodes according to the current routing topology, allowing the address space to be reorganized for optimal aggregation. This parameter change enables the network to transition from static to adaptive addressing.
2Adaptability or versatility
If routing topology changes frequently in LLNs, then network adaptability improves, but routing table management complexity and memory consumption increase
Solution Approach 1:
The patent enables self-organizing address assignment where parent nodes automatically assign address prefixes to child nodes based on current topology. This self-service mechanism eliminates the need for external management intervention during topology changes, allowing the network to adapt automatically while keeping management complexity low.
Solution Approach 2:
The system uses feedback from routing topology changes to trigger address reassignment. When topology changes are detected, parent nodes receive feedback and automatically reassign address prefixes to maintain optimal aggregation, thereby adapting to changes without increasing management complexity.
3Quantity of substance
If address aggregation is implemented in LLNs, then routing table size is reduced, but address assignment complexity increases
Solution Approach 1:
The patent segments the address assignment process into hierarchical levels where parent nodes assign prefixes to child nodes. This segmentation allows each node to manage only its local address assignments while benefiting from global aggregation, reducing overall complexity while maintaining route aggregation benefits.
Solution Approach 2:
Parent nodes perform preliminary address assignment by providing address prefixes to child nodes before routing occurs. This preliminary action establishes the foundation for automatic route aggregation, eliminating the need for complex post-configuration management while achieving routing table reduction.
Data Source
AI summary
A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate.