Random linear network coding for time-division duplexing: queueing analysis
Name
Lucani-2009-Random linear network coding for time-division duplexing queueing analysis.pdf
Size
566.25 KB
Format
Adobe PDF
Checksum (MD5)
93b1214886304118907b7f390b092b3e
Author(s)
Medard, Muriel
Stojanovic, Milica
Lucani, Daniel Enrique
Date Issued
August 2009
Journal
IEEE International Symposium on Information Theory, 2009. ISIT 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
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.
Version
Final published version
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 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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2009.5205888
