Improved delay estimates for a queueing model for random linear coding for unicast

Authors:
Mohammad Ravanbakhsh;Ángela I. Barbero;Øyvind Ytrehus
Affiliations:
Dept. of Informatics, University of Bergen, Bergen, Norway;Dept. of Applied Mathematics, University of Valladolid, Valladolid, Spain;Dept. of Informatics, University of Bergen, Bergen, Norway
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 4
Cited 0

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
On the Delay and Throughput Gains of Coding in Unreliable Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a lossy communication channel for unicast with zero-delay feedback. For this communication scenario, a simple retransmission scheme is optimum with respect to delay. An alternative approach is to use random linear coding in automatic repeat-request (ARQ) mode. We extend the work of Shrader and Ephremides in [1], by deriving an expression for the delay of random linear coding over a field of infinite size. Simulation results for various field sizes are also provided.