Distributed Data Synchronization Using Historical Node Weights

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In distributed systems, data synchronization between nodes is often slow and inefficient, leading to prolonged synchronization times and reduced system performance.

Innovation Solution

A data synchronization method that involves obtaining historical synchronization information from adjacent nodes, determining selection weight values based on efficiency metrics, and selecting an optimal adjacent node for data synchronization to improve efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data synchronization is performed between nodes in a distributed system, then data consistency is achieved, but synchronization time is prolonged and efficiency is reduced

Engineering Contradiction:
Improvedata consistencyVSAvoidsynchronization time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system pre-calculates and stores selection weight values for adjacent nodes based on historical synchronization information before actual data synchronization is needed. When synchronization is required, the pre-computed weights enable rapid selection of optimal nodes, avoiding time-consuming evaluations during the synchronization process itself

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent replaces traditional random or round-robin node selection mechanisms with an intelligent selection system that uses historical performance data and weight calculations to determine optimal synchronization nodes, thereby reducing synchronization time while maintaining data consistency

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

2Productivity

If traditional data synchronization methods are used, then all adjacent nodes can be utilized, but synchronization efficiency is low

Engineering Contradiction:
Improvesynchronization efficiencyVSAvoidnode selection complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system continuously monitors synchronization performance and updates historical data synchronization information, using this feedback to refine selection weight values. This creates a self-optimizing system that improves synchronization efficiency over time while managing node selection complexity through systematic weight-based evaluation

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent transforms the node selection problem from a complex multi-factor decision process into a simplified parameter-based selection by computing single weight values that encapsulate multiple performance metrics. This allows efficient comparison and selection while maintaining the ability to consider various performance aspects

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11645303B2Data synchronization method and apparatus of distributed system, medium, and electronic device
Publication Date: 2023.05.09 TENCENT TECHNOLOGY (SHENZHEN) CO LTD
  • US11645303B2 patent drawing
  • US11645303B2 patent drawing
  • US11645303B2 patent drawing

AI summary

Embodiments of this application provide a data synchronization method and apparatus in a distributed system, a computer-readable medium, and an electronic device. The method includes: obtaining historical data synchronization information of adjacent nodes connected to a target node and determining selection weight values of the adjacent nodes according to the historical data synchronization information. The selection weight values are used for measuring efficiency of the adjacent nodes synchronizing data to the target node to select, according to the selection weight values of the adjacent nodes, a target adjacent node for synchronizing data to the target node. Target data is synchronized from the selected target adjacent node with the target node.