Asynchronous Data Synchronization via Hash Verification

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In complex telecommunication environments, ensuring data consistency across multiple systems is challenging due to asynchronous data distribution models, which often lead to divergence and synchronization issues, especially in large-scale systems with high request rates and network failures.

Innovation Solution

A lightweight algorithm that hashes key data elements with a timestamp, creating a reference provisioning hash (UID_SYNC) to quickly validate data accuracy and determine the latest version, allowing systems to self-heal and maintain synchronization without relying on manual intervention.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If asynchronous event notification model is used for data distribution, then system performance and scalability are improved, but data consistency and synchronization between systems deteriorate

Engineering Contradiction:
Improvesystem performanceVSAvoiddata consistency
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent implements a feedback mechanism where systems periodically query a source system to compare their local data hashes with the source hash. This feedback loop enables detection of data divergence and triggers automatic synchronization requests, resolving the consistency issue while maintaining asynchronous operation benefits

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The system performs self-diagnosis by computing hashes of local data and comparing them with source hashes to detect synchronization issues. When divergence is detected, the system automatically initiates correction by requesting updated data from the source, enabling self-healing without manual intervention

Inventive Principle:
Principle #25Self-service

2Productivity

If data is replicated across multiple systems, then system availability and performance are improved, but data synchronization complexity increases

Engineering Contradiction:
Improvesystem availabilityVSAvoidsynchronization complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent transforms the complex problem of data comparison into a simple hash value comparison. By changing the parameter from comparing entire data sets to comparing cryptographic hashes, the system achieves efficient synchronization verification with minimal computational overhead

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces hash values as an intermediary representation of data state. Instead of directly comparing complex data structures across systems, the hash intermediary enables simple equality checks to determine synchronization status, greatly simplifying the coordination mechanism

Inventive Principle:
Principle #24Intermediary (Mediator)

3Measurement precision

If entire databases are exported and compared for auditing, then data accuracy verification is improved, but processing time and system resources increase

Engineering Contradiction:
Improvedata accuracy verificationVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent extracts the essential verification information from entire databases by computing cryptographic hashes of data subsets. This extraction approach maintains verification accuracy while reducing the amount of data that needs to be transmitted and compared, significantly cutting processing time

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS20240406260A1Synchronization of data in an asynchronous environment
Publication Date: 2024.12.05 T MOBILE US INC
  • US20240406260A1 patent drawing
  • US20240406260A1 patent drawing
  • US20240406260A1 patent drawing

AI summary

Systems and methods discussed herein are directed to a method within a wireless communication network that includes asynchronous data systems. The method may include a first node within an asynchronous data network receiving from a source node within the asynchronous data network, a data packet comprising a header, wherein the header comprises a hash indicating current data. The first node may compare the current data with stored data stored by the first node. Based at least in part on comparing the current data with stored data stored by the first node, the first node requests synchronization of the first node with the source node.