Random linear network coding for time-division duplexing: queueing analysis

Authors:
Daniel E. Lucani;Muriel Médard;Milica Stojanovic
Affiliations:
RLE, MIT, Cambridge, Massachusetts;RLE, MIT, Cambridge, Massachusetts;Northeastern University, Boston, Massachusetts
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 2
Cited 1

Random linear network coding for time division duplexing: energy analysis

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Optimal code length for bursty sources with deadlines

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network coding is provided for time division duplexing channels [1] by means of the moment generating function. We present numerical results for the mean number of packets in the queue and consider the effect of the range of allowable bulk sizes. We show that there exists an optimal choice of this range that minimizes the mean number of data packets in the queue.