FEC for Lower In-Order Delivery Delay in Packet Networks

TL;DR

This paper introduces a new class of streaming codes using FEC to significantly reduce in-order delivery delay in packet networks, outperforming traditional block codes through flexible redundancy placement and combined queuing and coding analysis.

Contribution

It proposes capacity-achieving streaming codes with flexible redundancy placement, offering improved delay-throughput trade-offs and a novel analysis combining queuing and coding theory.

Findings

Lower in-order delay demonstrated through simulations

Superior throughput-delay trade-off compared to block codes

Effective in diverse network scenarios

Abstract

We consider use of FEC to reduce in-order delivery delay over packet erasure channels. We propose a class of streaming codes that is capacity achieving and provides a superior throughput-delay trade-off compared to block codes by introducing flexibility in where and when redundancy is placed. This flexibility results in significantly lower in-order delay for a given throughput for a wide range of network scenarios. Furthermore, a major contribution of this paper is the combination of queuing and coding theory to analyze the code's performance. Finally, we present simulation and experimental results illustrating the code's benefits.