Packet-Coded Data Transfer with Adaptive Redundancy Rate Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication protocols, such as TCP, face challenges in efficiently delivering data over modern Internet networks due to variability in network characteristics, leading to delays, interruptions, and inefficient bandwidth use, while alternative protocols like UDP may prioritize speed at the expense of reliability.
Innovation Solution
A method for data communication that involves determining redundancy messages using error correcting codes, adjusting transmission limits based on delivery rates, and dynamically switching between TCP and UDP protocols to optimize throughput and reliability across different network paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP protocol is used for reliable data delivery, then reliability is improved, but transmission speed deteriorates due to retransmission overhead and congestion control
Solution Approach 1:
The patent applies forward error correction by pre-calculating and attaching redundancy data to packets before transmission. This preliminary action enables the receiver to correct errors without requiring retransmission, thus maintaining reliability while improving transmission speed by eliminating the retransmission wait time inherent in TCP's stop-and-wait approach.
Solution Approach 2:
The patent changes the error handling parameter from reactive retransmission (TCP's approach) to proactive error prevention through forward error correction. By transforming the data with error-correcting codes before transmission, the system achieves both high reliability and high speed, as corrections happen locally at the receiver without requiring additional round-trip communication.
2Speed
If UDP protocol is used for fast data transmission, then transmission speed is improved, but reliability deteriorates due to lack of error correction and retransmission
Solution Approach 1:
The patent applies forward error correction by pre-calculating and attaching redundancy data to packets before transmission. This preliminary action enables the receiver to correct errors without requiring retransmission, thus maintaining reliability while improving transmission speed by eliminating the retransmission wait time inherent in TCP's stop-and-wait approach.
Solution Approach 2:
The patent introduces forward error correction codes as an intermediary mechanism between sender and receiver. This intermediary enables the receiver to independently correct errors without involving the sender in the correction process, thus achieving TCP-like reliability with UDP-like speed by eliminating the need for interactive retransmission protocols.
3Productivity
If network coding is applied to improve throughput, then productivity is improved, but device complexity increases due to encoding and decoding operations
Solution Approach 1:
The patent applies forward error correction by pre-calculating and attaching redundancy data to packets before transmission. This preliminary action enables the receiver to correct errors without requiring retransmission, thus maintaining reliability while improving transmission speed by eliminating the retransmission wait time inherent in TCP's stop-and-wait approach.
Data Source
AI summary
A method for data communication between a first node and a second node includes forming one or more redundancy messages from data messages at the first node using an error correcting code and transmitting first messages from the first node to the second node over a data path, the transmitted first messages including the data messages and the one or more redundancy messages. Second messages are received at the first node from the second node, which are indicative of: (i) a rate of arrival at the second node of the first messages, and (ii) successful and unsuccessful delivery of the first messages. A transmission rate limit and a window size are maintained according to the received second messages. Transmission of additional messages from the first node to the second node is limited according to the maintained transmission rate limit and window size.