Interspersed Packet Erasure Coding for Low In-Order Delay
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional erasure coding methods in communication networks result in significant delay due to the placement of redundant coded packets at the end of a block, which requires buffering all subsequent packets until lost packets can be reconstructed, leading to increased in-order delivery delay.
Innovation Solution
Interspersing redundant coded packets amongst information packets based on packet loss rate and other factors, allowing for earlier reconstruction of lost packets and reducing overall delivery delay by constructing coded packets as random linear combinations of preceding information packets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If coded packets are placed at the end of a block to maximize throughput capacity, then network throughput efficiency is improved, but in-order packet delivery delay increases significantly
Solution Approach 1:
The patent divides the block of information packets into multiple segments and inserts coded packets at different positions within each segment rather than concentrating all coded packets at the end. This segmentation allows earlier reconstruction of lost packets while maintaining good throughput efficiency.
Solution Approach 2:
The patent dynamically determines the position of coded packets based on packet loss rates and network conditions. When packet loss is high, coded packets are inserted earlier in the block; when loss is low, they are placed later to maximize throughput. This dynamic adaptation resolves the contradiction between throughput efficiency and delay.
2Loss of time
If block size is reduced to decrease delay, then in-order packet delivery delay is improved, but throughput efficiency deteriorates
Solution Approach 1:
Instead of using a single small block size, the patent segments a larger block into multiple sub-blocks with coded packets inserted at strategic positions within each sub-block. This maintains the benefits of smaller effective processing units (reducing delay) while utilizing the full capacity of the larger block (maintaining throughput efficiency).
Solution Approach 2:
The patent introduces a new dimension to block structure by allowing coded packets to appear at multiple positions within a block rather than only at the end. This dimensional change in code placement enables the system to achieve low delay performance without sacrificing throughput efficiency.
3Productivity
If coded packets are transmitted after all information packets in a block, then maximum use of network capacity is achieved, but all subsequent packets must be buffered until lost packets are reconstructed
Solution Approach 1:
The patent performs preliminary action by inserting coded packets at intermediate positions within blocks rather than waiting until the end. This allows the receiver to begin reconstruction of lost packets earlier, reducing the buffering requirement for subsequent packets while still achieving good network capacity utilization.
Data Source
AI summary
Provided is a method for correcting errors in a data transmission network, comprising: transmitting a plurality of uncoded information packets across a network path; transmitting a plurality of coded packets for recovering information packets lost in transmission across said network path, the coded packets being temporally interspersed among said uncoded information packets, wherein the coded packets are encoded based on information packets transmitted prior to a previously transmitted coded packet; and determining the interspersion of the coded packets according to a packet loss rate.