Packet-Coded Network Communication With Feedback-Based Transmission Limits
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication protocols, such as TCP, face challenges in efficiently delivering data packets over diverse and dynamic networks, leading to issues like long delays, interruptions in streaming, and inefficient bandwidth use due to restrictive congestion control and high retransmission rates.
Innovation Solution
The Packet Coding Transmission Control Protocol (PC-TCP) addresses these issues by 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 window sizes, ensuring fair and reliable data transfer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP uses retransmission and windowing algorithms for congestion control, then reliable and fair delivery is achieved, but delays increase and bandwidth utilization becomes inefficient
Solution Approach 1:
The patent applies preliminary action by sending redundant packets in advance before they are actually needed. Instead of waiting for packet loss to occur and then retransmitting, the system pre-generates and transmits extra coded packets that can immediately replace lost packets, thereby eliminating retransmission delays while maintaining reliable delivery
Solution Approach 2:
The patent introduces an intermediary mechanism in the form of coded redundant packets that act as mediators between the sender and receiver. These intermediary packets contain encoded information from multiple original packets, allowing the receiver to reconstruct lost data without direct retransmission from the original sender, thus reducing delay while preserving reliability
2Stability of the object's composition
If TCP uses restrictive congestion control, then network stability is maintained, but bandwidth utilization becomes inefficient
Solution Approach 1:
The patent implements feedback mechanisms where the receiver sends acknowledgments about received packets and the sender adjusts the rate of redundant packet transmission accordingly. This feedback loop allows the system to maintain network stability by responding to actual network conditions while optimizing bandwidth utilization by dynamically adjusting transmission rates based on receiver needs and network capacity
Solution Approach 2:
The patent applies parameter changes by dynamically adjusting the number and rate of redundant packets transmitted based on network conditions, receiver buffer status, and packet loss patterns. This allows the system to adapt transmission parameters in real-time, maintaining stability while maximizing bandwidth utilization through optimized redundancy levels
3Reliability
If TCP uses high retransmission rates, then reliable delivery is ensured, but bandwidth is wasted
Solution Approach 1:
The patent converts the traditionally harmful effect of packet loss into a benefit by using coded redundant packets. Instead of treating packet loss as an error requiring costly retransmission, the system designs the transmission to include pre-coded replacements that turn potential waste into useful redundancy, ensuring delivery reliability while minimizing bandwidth waste through efficient error correction
4Stability of the object's composition
If TCP window size is limited for congestion control, then network stability is maintained, but transmission speed decreases
Solution Approach 1:
The patent applies segmentation by dividing the transmission into batches of original packets followed by batches of redundant packets. This segmentation allows the system to manage congestion control in manageable segments rather than continuously limiting the entire transmission window, thereby maintaining stability while enabling faster transmission through structured batching and prioritized redundant packet sending
Data Source
AI summary
A method for data communication between a first node and a second node over a data path 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. The first messages include the data messages and the redundancy messages. The method includes, receiving, at the first node, second messages indicative of a rate of arrival at the second node of the messages transmitted from the first node, and 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 received second messages. Transmission of first messages from the first node to the second node is inhibited according to the maintained first transmission limit, and according to the second transmission limit.


