Distributed Node Migration for LLN Load Balancing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Low Power and Lossy Networks (LLNs) face challenges such as communication and memory bottlenecks at the LLN Border Router (LBR), which can lead to significant resource imbalances and increased failover times due to LBR failures, as all nodes must migrate to a new LBR upon failure.

Innovation Solution

A distributed mechanism allows devices to autonomously migrate between different routing domains by calculating a switching probability based on network size differences and optional resource factors, balancing the load across LBRs without requiring the root node to maintain per-node state, using a self-stabilizing decision process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If all nodes migrate to a new LBR upon LBR failure, then network reliability is maintained, but failover time increases and network stability deteriorates

Engineering Contradiction:
Improvenetwork reliabilityVSAvoidfailover time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by having nodes proactively select and attach to alternative LBRs before the current LBR fails. Nodes continuously monitor LBR health and pre-establish backup attachments, so when failure occurs, the migration is already initiated or can immediately occur without full network-wide reconfiguration, significantly reducing failover time while maintaining reliability

Inventive Principle:
Principle #10Preliminary action

2Device complexity

If nodes are concentrated under a single LBR, then routing domain management is simplified, but resource imbalance and communication bottlenecks worsen

Engineering Contradiction:
Improverouting domain management complexityVSAvoidnetwork throughput
Core Design Contradiction:
Device complexityVSProductivity

Solution Approach 1:

The patent applies dynamics by enabling nodes to dynamically select and migrate between multiple LBRs based on real-time conditions such as load, bandwidth availability, and network status. This dynamic attachment allows the network to automatically balance load across LBRs, preventing bottlenecks and maintaining high throughput while keeping management complexity reasonable through standardized attachment procedures

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent applies parameter changes by allowing nodes to change their attachment parameters (which LBR they connect to) based on network conditions. Nodes can modify their routing decisions and LBR selection based on metrics like current load, available bandwidth, and network congestion, thereby distributing traffic more evenly across multiple LBRs to improve overall network productivity

Inventive Principle:
Principle #35Parameter changes

3Productivity

If nodes autonomously migrate between routing domains, then load balancing across LBRs improves, but network complexity and control overhead increase

Engineering Contradiction:
Improveload balancing efficiencyVSAvoidmigration control complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent applies self-service by enabling nodes to autonomously perform load balancing migrations without requiring centralized control or complex coordination mechanisms. Each node independently monitors network conditions, evaluates alternative LBRs, and decides its own migration timing based on simple criteria, achieving effective load balancing through distributed self-service decisions rather than complex centralized control

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS8934366B2Distributed node migration between routing domains
Publication Date: 2015.01.13 CISCO TECHNOLOGY INC
  • US8934366B2 patent drawing
  • US8934366B2 patent drawing
  • US8934366B2 patent drawing

AI summary

In one embodiment, a device connected to a network receives at a network interface a first network size indicator for a first network and a second network size indicator for a second network. A difference between the first network size indicator and the second network size indicator is determined and a switching probability is calculated if the difference between the network size indicators is greater than a predetermined network size difference threshold. The device may then migrate from the first network to the second network based on the switching probability.