pith. sign in

arxiv: 1509.00167 · v2 · pith:JOZKMRS5new · submitted 2015-09-01 · 💻 cs.IT · math.IT

FEC for Lower In-Order Delivery Delay in Packet Networks

classification 💻 cs.IT math.IT
keywords delayin-ordercodecodesdeliveryflexibilitylowerpacket
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.