Packet Coding with Adaptive Rate Control for Reliable Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication protocols, such as TCP, face challenges in efficiently transmitting 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 loss events, and dynamically switching between TCP and UDP protocols to optimize throughput and fairness.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP protocol is used for reliable data transmission, then delivery reliability is improved, but transmission speed and throughput deteriorate due to retransmission overhead and congestion control
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing redundancy messages (error correction codes) at the transmitter before data transmission. These pre-computed redundancy messages are sent along with the data messages, enabling the receiver to reconstruct lost packets without requiring retransmission requests, thus resolving the contradiction between reliability and speed by preparing error correction capabilities in advance
Solution Approach 2:
The patent introduces redundancy messages as an intermediary element that mediates between the data messages and the communication channel. These intermediary redundancy messages carry error correction information that enables the receiver to recover from transmission errors and losses, effectively decoupling the reliability function from the speed-constraining retransmission mechanism
2Productivity
If UDP protocol is used for high-speed data transmission, then transmission speed is improved, but delivery reliability deteriorates due to lack of error correction and retransmission
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing redundancy messages (error correction codes) at the transmitter before data transmission. These pre-computed redundancy messages are sent along with the data messages, enabling the receiver to reconstruct lost packets without requiring retransmission requests, thus resolving the contradiction between reliability and speed by preparing error correction capabilities in advance
Solution Approach 2:
The patent implements self-service by enabling the receiver to autonomously recover from transmission errors using the embedded redundancy messages. The receiver can independently reconstruct lost or corrupted packets using error correcting codes without needing external retransmission services, thus achieving both high speed (no retransmission waiting) and high reliability (self-healing capability)
3Reliability
If fixed transmission limits are imposed to ensure fairness, then network fairness is improved, but throughput and utilization deteriorate due to inability to adapt to varying network conditions
Solution Approach 1:
The patent applies dynamics by implementing adaptive transmission limits that dynamically adjust based on real-time network conditions. The system monitors delivery rates and loss events, then modifies transmission limits accordingly, allowing the network to maintain fairness under normal conditions while achieving higher throughput when network capacity permits, thus resolving the contradiction between fixed fairness guarantees and adaptive throughput optimization
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.