Packet-Coded Data Transmission for Congestion and Delay Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication protocols, such as TCP, face challenges in efficiently delivering data packets over diverse and dynamic network conditions, leading to delays, interruptions, and inefficient bandwidth use, especially in real-time applications like video and audio streaming.
Innovation Solution
The Packet Coding Transmission Control Protocol (PC-TCP) method involves determining redundancy messages using error correcting codes, transmitting these along with data messages, and adjusting transmission limits based on receipt acknowledgments to optimize delivery rates and prevent congestion, while maintaining fair bandwidth allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP uses retransmission and windowing algorithms for congestion control, then reliable data delivery is achieved, but real-time requirements and rapidly varying network characteristics are not well matched
Solution Approach 1:
The patent implements dynamic congestion control by continuously adjusting the congestion window size based on real-time network conditions. The system monitors packet delivery status and dynamically modifies transmission parameters to adapt to rapidly changing network characteristics, moving away from static windowing algorithms.
Solution Approach 2:
The patent employs feedback mechanisms where the receiver sends acknowledgments about packet delivery status to the sender. The sender uses this feedback information to dynamically adjust its transmission rate and congestion window, creating a closed-loop control system that adapts to network conditions.
2Reliability
If TCP relies on retransmission for error correction, then data reliability is maintained, but delays increase and bandwidth utilization becomes inefficient
Solution Approach 1:
The patent applies forward error correction codes to data packets before transmission. This preliminary encoding adds redundancy information that enables the receiver to detect and correct errors without requiring retransmission, thereby preventing delays while maintaining reliability.
Solution Approach 2:
The patent converts the traditionally harmful effect of adding error correction overhead into a beneficial feature by using efficient coding schemes that provide robust error correction with minimal bandwidth overhead. The redundancy added for error correction actually improves overall system efficiency by eliminating the need for time-consuming retransmissions.
3Adaptability or versatility
If TCP uses windowing algorithms for congestion control, then fair bandwidth allocation is achieved, but bandwidth utilization efficiency decreases
Solution Approach 1:
The patent implements dynamic congestion window adjustment that responds to real-time network feedback. Rather than using conservative static window sizes, the system dynamically scales the window size based on actual network capacity and congestion levels, achieving both fairness and high utilization.
Solution Approach 2:
The patent changes key transmission parameters such as congestion window size, transmission rate, and error correction code rate based on network conditions. By dynamically adjusting these parameters, the system optimizes bandwidth utilization while maintaining fair allocation among competing flows.
Data Source
AI summary
A method for data communication between a first node and a second node over a data path includes determining one or more redundancy messages from data messages at the first node using an error correcting code and transmitting messages from the first node to the second node. The transmitted messages include the data messages and the redundancy messages. The method includes, receiving, at the first node, a first plurality of messages including messages indicative of a rate of arrival at the second node of the messages transmitted from the first node and messages indicative of successful and unsuccessful delivery of the messages transmitted from the first node to the second node. A first transmission limit and a second transmission limit are maintained according to the first plurality of messages. Transmission of messages from the first node to the second node is limited according to the maintained first transmission limit, and according to the second transmission limit.