Parallel-Link Load Balancer Using Sparse Weighted Round Robin

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing load balancers in networks with parallel links fail to evenly distribute traffic across non-symmetrical links, leading to congestion and increased latency due to inefficient routing mechanisms that do not consider current network status.

Innovation Solution

A load balancer using sparse thermometer coding and weighted round robin scheduling to dynamically adjust traffic distribution based on link weights, ensuring even distribution and minimizing congestion by interleaving bits in a combined sparse vector.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If traditional load balancers are used to distribute traffic across parallel links, then traffic routing is simplified, but traffic distribution becomes uneven leading to congestion and increased latency

Engineering Contradiction:
Improvetraffic routing simplicityVSAvoidtraffic distribution evenness
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The load balancer dynamically adjusts traffic distribution weights based on real-time network status for each parallel link, transitioning from static to dynamic routing decisions. This allows the system to adapt to changing link conditions and maintain even traffic distribution across non-symmetrical links.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The system implements feedback mechanisms by monitoring network status of parallel links and using this information to adjust traffic distribution weights. The load balancer continuously receives status updates and modifies routing decisions accordingly, preventing congestion and reducing latency through responsive traffic management.

Inventive Principle:
Principle #23Feedback

2Productivity

If adaptive routing is implemented to maximize network utilization, then bandwidth utilization improves, but complexity of traffic management increases

Engineering Contradiction:
Improvenetwork utilizationVSAvoidtraffic management complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The invention changes the parameter of traffic distribution by introducing weight values associated with each parallel link based on network status. This parameter adjustment allows the load balancer to optimize network utilization by directing more traffic to healthier links while maintaining manageable complexity through a systematic weighting approach.

Inventive Principle:
Principle #35Parameter changes

3Measurement precision

If weights indicating network status are used for load balancing, then routing decisions become more informed, but traffic bursts towards certain links occur causing high application latency

Engineering Contradiction:
Improvenetwork status awarenessVSAvoidapplication latency
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The load balancer implements periodic redistribution of traffic weights to prevent sustained traffic bursts towards specific links. By periodically adjusting the weight assignments based on current network status, the system ensures more uniform traffic distribution over time, reducing application latency while maintaining informed routing decisions.

Inventive Principle:
Principle #19Periodic action

Data Source

PatentUS20250240252A1Load balancer for parallel link networks using weighted round robin scheduling
Publication Date: 2025.07.24 MELLANOX TECHNOLOGIES LTD(IL)
  • US20250240252A1 patent drawing
  • US20250240252A1 patent drawing
  • US20250240252A1 patent drawing

AI summary

Approaches disclosed herein provide for the use of load balancers to perform tasks such as to queue traffic. In at least one embodiment, a plurality of parallel links queue traffic by, at least in part, representing a weight of the plurality of parallel links as a plurality of bit strings, where the plurality of bit strings are converted to a plurality of sparse bit strings, and where the plurality of sparse bit strings to be used to generate a representative vector of sequentially interleaved bits of the plurality of sparse bit strings. The traffic for the plurality of parallel links can be queued according to the representative vector. The load balancer may be used in a computer network to manage traffic between nodes connected by parallel links.