Dictionary Synchronization via Guaranteed Packet Ordering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network transport methods, such as TCP, do not guarantee packet ordering, leading to inefficiencies in data transmission and communication between applications, particularly in scenarios requiring duplex communication for data synchronization.
Innovation Solution
Implementing a packet transport with guaranteed packet ordering, utilizing a deterministic allocation algorithm for dictionary synchronization between applications, which eliminates the need for duplex communication by ensuring that data chunk addresses are computed identically on both the transmitter and receiver sides, thus allowing for efficient data de-duplication and bandwidth conservation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP (Transmission Control Protocol) is used for data transport, then packet ordering is guaranteed, but network throughput is insufficient
Solution Approach 1:
The patent segments data into fixed-size chunks and uses independent parallel streams to transmit these chunks. Each stream maintains packet ordering independently, while the overall system achieves higher throughput through parallelization. The receiver reassembles chunks in the correct order using sequence numbers, resolving the contradiction between ordering guarantees and throughput.
2Productivity
If Parallel TCP is used to increase throughput, then network throughput improves, but packet ordering is not guaranteed
Solution Approach 1:
The patent implements feedback mechanisms where the receiver sends acknowledgments for received chunks, and the transmitter uses this feedback to manage parallel streams and ensure proper ordering. Sequence numbers and chunk indexing provide feedback loops that maintain ordering guarantees while utilizing parallel throughput.
3Reliability
If duplex communication is implemented for data synchronization, then data transmission reliability improves, but communication overhead increases
Solution Approach 1:
The patent employs self-service mechanisms where both transmitter and receiver independently compute dictionary hashes and maintain synchronization without requiring continuous duplex communication. The deterministic allocation algorithm allows each side to autonomously manage dictionary state, reducing communication overhead while maintaining synchronization reliability.
4Loss of energy
If dictionary synchronization is performed without guaranteed packet ordering, then bandwidth consumption decreases, but data integrity is compromised
Solution Approach 1:
The patent performs preliminary actions by pre-computing dictionary hashes and maintaining local dictionaries on both transmitter and receiver sides. This preliminary synchronization allows the system to operate with minimal communication, achieving low bandwidth consumption while preserving data integrity through the guaranteed ordering of the underlying transport mechanism.
Data Source
AI summary
Systems and methods of dictionary synchronization between applications over a network are provided. The dictionary synchronization can be performed with guaranteed packet ordering. With guaranteed packet ordering, operations such as data de-duplication can be performed over the wire or network.


