Packet Coding Layer With Adaptive Redundancy for Reliable Throughput
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 issues like long delays, interruptions in streaming, and inefficient bandwidth use, while alternative protocols like UDP may not ensure reliable data delivery.
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 managing redundancy transmission to optimize data delivery over diverse network paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP protocol is used for reliable data delivery, then data reliability is improved, but transmission speed and bandwidth efficiency deteriorate due to retransmissions and congestion control
Solution Approach 1:
The patent applies forward error correction by pre-calculating and attaching redundancy information to data packets before transmission. This preliminary action enables the receiver to correct errors without requiring retransmissions, thus maintaining reliability while improving transmission speed and bandwidth efficiency.
Solution Approach 2:
The patent introduces an intermediate coding layer between the application layer and transport layer that performs packet coding with redundancy insertion. This intermediary component transforms raw data packets into coded packets with embedded error correction capabilities, resolving the contradiction between reliability and speed by adding error correction functionality without requiring TCP's complex retransmission mechanisms.
2Productivity
If UDP protocol is used for high-speed transmission, then transmission speed is improved, but data delivery 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 information to data packets before transmission. This preliminary action enables the receiver to correct errors without requiring retransmissions, thus maintaining reliability while improving transmission speed and bandwidth efficiency.
Solution Approach 2:
The patent introduces an intermediate coding layer between the application layer and transport layer that performs packet coding with redundancy insertion. This intermediary component transforms raw data packets into coded packets with embedded error correction capabilities, resolving the contradiction between reliability and speed by adding error correction functionality without requiring TCP's complex retransmission mechanisms.
3Reliability
If redundancy messages are transmitted to ensure reliable delivery, then data reliability is improved, but bandwidth usage and transmission overhead increase
Solution Approach 1:
The patent dynamically adjusts the amount of redundancy information based on measured channel conditions and packet loss rates. When network conditions are good, less redundancy is added; when conditions deteriorate, more redundancy is inserted. This parameter adjustment optimizes the trade-off between reliability and bandwidth consumption.
Solution Approach 2:
The patent implements a feedback mechanism where the receiver monitors packet loss and sends acknowledgments to the transmitter. Based on this feedback, the transmitter adjusts the redundancy level in subsequent transmissions, ensuring optimal bandwidth usage while maintaining required reliability levels.
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.