Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis
Information Theory
2009-03-26 v1 math.IT
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.
Keywords
Cite
@article{arxiv.0903.4434,
title = {Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis},
author = {Daniel E. Lucani and Muriel Médard and Milica Stojanovic},
journal= {arXiv preprint arXiv:0903.4434},
year = {2009}
}
Comments
5 pages, 5 figures, 2 tables, Submitted to ISIT 2009