Random linear network coding for time-division duplexing: queueing analysis
Author(s)Medard, Muriel; Stojanovic, Milica; Lucani, Daniel Enrique
DownloadLucani-2009-Random linear network coding for time-division duplexing queueing analysis.pdf (566.2Kb)
MetadataShow full item record
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 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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
IEEE International Symposium on Information Theory, 2009. ISIT 2009
Institute of Electrical and Electronics Engineers
Medard, M., D.E. Lucani, and M. Stojanovic. “Random linear network coding for time-division duplexing: Queueing analysis.” Information Theory, 2009. ISIT 2009. IEEE International Symposium on. 2009. 1423-1427.©2009 IEEE.
Final published version
INSPEC Accession Number: 10842342