Show simple item record

dc.contributor.authorMedard, Muriel
dc.contributor.authorStojanovic, Milica
dc.contributor.authorLucani, Daniel Enrique
dc.date.accessioned2010-11-12T19:57:01Z
dc.date.available2010-11-12T19:57:01Z
dc.date.issued2009-08
dc.date.submitted2009-06
dc.identifier.isbn978-1-4244-4312-3
dc.identifier.otherINSPEC Accession Number: 10842342
dc.identifier.urihttp://hdl.handle.net/1721.1/59979
dc.description.abstractWe 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CNS-0627021)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (No. 0831728)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (No. 0520075)en_US
dc.description.sponsorshipUnited States. Office of Naval Research (ONR MURI Grant No. N00014-07-1-0738)en_US
dc.description.sponsorshipBae Systems National Security Solutions Inc. (subcontract #060786)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agencyen_US
dc.description.sponsorshipSpace and Naval Warfare Systems Center San Diego (U.S.) (contract No. N66001-06-C-2020)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISIT.2009.5205888en_US
dc.rightsArticle 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.en_US
dc.sourceIEEEen_US
dc.titleRandom linear network coding for time-division duplexing: queueing analysisen_US
dc.typeArticleen_US
dc.identifier.citationMedard, 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronicsen_US
dc.contributor.approverMedard, Muriel
dc.contributor.mitauthorMedard, Muriel
dc.contributor.mitauthorLucani, Daniel Enrique
dc.relation.journalIEEE International Symposium on Information Theory, 2009. ISIT 2009en_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsLucani, Daniel E.; Medard, Muriel; Stojanovic, Milicaen
dc.identifier.orcidhttps://orcid.org/0000-0003-4059-407X
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record