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

Author(s)
Medard, Muriel; Stojanovic, Milica; Lucani, Daniel Enrique
Thumbnail
DownloadLucani-2009-Random linear network coding for time-division duplexing queueing analysis.pdf (566.2Kb)
PUBLISHER_POLICY
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.
Metadata
Show full item record
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.
Date issued
2009-08
URI
http://hdl.handle.net/1721.1/59979
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of Electronics
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
Other identifiers
INSPEC Accession Number: 10842342
ISBN
978-1-4244-4312-3
Collections