Weighted Load Balancing for Data Access Nodes

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current database management systems lack the ability to differentiate the weights of data access nodes, requiring similar hardware configurations to handle traffic, and fail to rebalance data effectively when nodes are added, removed, or their hardware configurations change, leading to unbalanced systems and potential service interruptions.

Innovation Solution

A weighted load balancing method that updates routing tables to redistribute virtual nodes based on node weights, allowing for different hardware configurations and minimizing data shifts during node additions, removals, or weight changes, ensuring seamless system scaling and rebalancing without service interruptions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data access nodes have similar hardware configuration to handle the same amount of traffic, then system stability is improved, but system adaptability deteriorates

Engineering Contradiction:
Improvesystem stabilityVSAvoidhardware configuration flexibility
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent assigns different weights to different data access nodes based on their hardware configuration capabilities. Each node can have a customized weight value that reflects its local quality (processing power, storage capacity, network bandwidth), allowing the system to differentiate and utilize nodes with varying hardware specifications effectively.

Inventive Principle:
Principle #3Local quality

2Productivity

If nodes are added or removed from the system, then system scalability is improved, but load balancing deteriorates

Engineering Contradiction:
Improvesystem scalabilityVSAvoidload balancing
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent pre-calculates and stores routing information in a routing table that maps data keys to appropriate nodes based on current system state. When nodes are added or removed, the routing table is updated in advance to reflect the new configuration, ensuring that load balancing is maintained without interrupting service. This preliminary preparation of routing information allows seamless integration or removal of nodes.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If hardware configuration of nodes is changed, then system adaptability is improved, but load balancing deteriorates

Engineering Contradiction:
Improvehardware configuration flexibilityVSAvoidload balancing
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The patent implements a feedback mechanism where the system continuously monitors the hardware configuration and performance metrics of data access nodes. When hardware changes are detected, the system automatically recalculates optimal routing paths and updates the routing table accordingly. This feedback loop ensures that load balancing is dynamically adjusted to accommodate hardware configuration changes without manual intervention or service interruption.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11057460B2Weighted load balancing method on data access nodes
Publication Date: 2021.07.06 VIETTEL GRP
  • US11057460B2 patent drawing
  • US11057460B2 patent drawing
  • US11057460B2 patent drawing

AI summary

The weighted load balancing method on data access nodes ensures the ability to horizontally scale the data access system, the load handling capacity of the system is increased linearly according to the number of data access nodes. The proposed method includes the following steps: step 1: update the routing table, when adding, removing nodes or changing nodes' weight, move virtual nodes from node having decreased number of virtual nodes to node having increased number of virtual nodes; step 2: store old routing table on array Ai and new routing table on array A2; step 3: block access to records that need to be moved; step 4: copy records from old node to node; step 5: perform read/write access using data partitioning method with new routing table A2; step 6: clean duplicated records.