Network Node Data Synchronization with Selective Fragment Acknowledgment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In unreliable networks with high packet loss and low data rates, existing data synchronization methods face challenges in ensuring data replication consistency, scalability, fault tolerance, and security due to inefficient acknowledgement mechanisms, network congestion, and increased computational overhead.
Innovation Solution
A computer-implemented method and system using a data exchange platform with a messaging API, transport plugins, and a synchronization protocol, including an AMQ filter and Merkle tree, to efficiently synchronize data across multiple network nodes by fragmenting data, applying hash functions, and utilizing pre-defined configurations to adapt to network conditions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional acknowledgement mechanisms are used to ensure data delivery, then data replication consistency is improved, but network congestion increases and performance degrades in high packet loss networks
Solution Approach 1:
The patent segments data into fragments and uses selective acknowledgment (SACK) to acknowledge only successfully received fragments. This allows the sender to retransmit only lost fragments rather than resending entire data sets, reducing unnecessary network traffic while maintaining data consistency.
Solution Approach 2:
The patent implements feedback mechanisms where receivers send acknowledgments for successfully received data fragments. The sender uses this feedback to determine which fragments need retransmission, enabling efficient error recovery without continuous full-data retransmission that causes network congestion.
2Reliability
If data is retransmitted immediately upon acknowledgement loss, then data delivery reliability is improved, but unnecessary network traffic increases due to successful deliveries with lost acknowledgements
Solution Approach 1:
Instead of retransmitting all data upon acknowledgement loss, the patent applies partial action by retransmitting only the specific fragments that were not acknowledged. The system waits for a timeout period and only retransmits the minimal necessary data (unacknowledged fragments), avoiding excessive retransmission of already-delivered data.
Solution Approach 2:
The patent sends multiple copies of data fragments through different paths or at different times before considering them lost. This preliminary redundancy ensures that even if some transmissions fail, other copies may succeed, reducing the need for extensive retransmission.
3Reliability
If node states are compared periodically to handle node failures, then fault tolerance is improved, but network congestion increases due to large data comparison requirements
Solution Approach 1:
The patent extracts only the essential synchronization information (fragment acknowledgments and sequence numbers) from complete node states for comparison purposes. Instead of comparing entire data sets, the system compares minimal metadata that indicates synchronization status, dramatically reducing comparison data volume while maintaining fault detection capability.
Solution Approach 2:
The patent uses hash values or checksums as compact copies of data state for comparison. Instead of transmitting and comparing actual data fragments, the system compares these compressed representations, which occupy minimal space but accurately reflect data integrity and synchronization status.
4Reliability
If encryption is applied to secure data during synchronization, then data security is improved, but computational overhead and latency increase
Solution Approach 1:
The patent applies encryption to data fragments before fragmentation and transmission. This preliminary encryption ensures that even if fragments are intercepted or lost, the confidential information remains protected. The encryption is performed once on the original data, and the same cryptographic operations are applied to all derived fragments, avoiding repeated encryption overhead during each transmission cycle.
Data Source
AI summary
Disclosed is a computer-implemented method for synchronizing data messages between multiple network nodes of a network. The multiple network nodes include a first network node and second network nodes. The method includes installing a data exchange platform in the first network node and in the second network nodes, wherein the data exchange platform has, a messaging API, a transport plugin interface, and a synchronization protocol; providing a set of transport plugins, to at least one network node of the multiple network nodes; identifying second network nodes requesting to synchronize the one or more data messages and the data messages to be synchronized; and implementing the synchronization protocol for synchronizing the data messages between the first network node and the second network nodes by transferring the data messages from the first network node to the second network nodes.