Packet Payload Mapping With Stride-Based Loss Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data transmission protocols like TCP and UDP face challenges in balancing reliability and efficiency, with TCP being too reliable but bandwidth-heavy and UDP being too unreliable for real-time applications.
Innovation Solution
A packet-frame mapping scheme that uses a stride parameter to distribute redundant data, allowing for robust recovery from packet loss, particularly in high-traffic wireless networks, by using a ring buffer and reassembly buffer to manage and reconstruct lost data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TCP protocol is used with retransmission mechanisms, then data reliability is improved, but bandwidth overhead increases and latency increases
Solution Approach 1:
The patent applies preliminary action by embedding redundant data copies in advance within the same packet transmission. Instead of waiting for loss detection to trigger retransmission, the system pre-places alternative data representations that can be immediately used if loss occurs, eliminating the need for additional retransmission bandwidth.
Solution Approach 2:
The patent segments data into multiple representations or copies within a single packet structure. By dividing the data payload into alternative segments that can substitute for each other, the system provides redundancy without requiring complete packet retransmissions, thus reducing bandwidth overhead while maintaining reliability.
2Reliability
If TCP protocol is used with retransmission mechanisms, then data reliability is improved, but latency increases
Solution Approach 1:
The patent prepares alternative data copies in advance within the packet, so that if loss is detected, the receiver can immediately use the embedded alternative without waiting for retransmission. This eliminates the time delay associated with traditional retransmission protocols while maintaining data reliability.
3Productivity
If UDP protocol is used for transmission, then bandwidth overhead is reduced and transmission speed is improved, but data reliability deteriorates
Solution Approach 1:
The patent embeds redundant data representations directly in the UDP packet before transmission. This preliminary preparation ensures that if packet loss occurs, the receiver can immediately use the embedded alternative without requiring retransmission, thus maintaining UDP's speed advantage while improving reliability.
Solution Approach 2:
The patent divides data into multiple representational segments within the UDP packet payload. These segments are structured so that any one can serve as a valid replacement, providing reliability through diversity rather than through redundant transmission, thus maintaining transmission efficiency.
4Reliability
If redundant data copies are created for every client, then data reliability is improved, but bandwidth consumption increases
Solution Approach 1:
The patent merges multiple clients' redundancy needs into a single packet structure by embedding alternative data representations that serve all clients simultaneously. Instead of creating separate redundant copies for each client, the system combines redundancy at the packet level, reducing overall bandwidth consumption while maintaining reliability for all receivers.
Data Source
AI summary
Systems and methods for packet payload mapping for robust transmission of data are described. For example, methods may include receiving, using a network interface, packets that each respectively include a primary frame and one or more preceding frames from the sequence of frames of data that are separated from the primary frame in the sequence of frames by a respective multiple of a stride parameter; storing the frames of the packets in a buffer with entries that each hold the primary frame and the one or more preceding frames of a packet; reading a first frame from the buffer as the primary frame from one of the entries; determining that a packet with a primary frame that is a next frame in the sequence has been lost; and, responsive to the determination, reading the next frame from the buffer as a preceding frame from one of the entries.