Random Linear Network Coding for Time-Division Duplexing: Queueing Analysis

Simple item page
dc.creatorLucani, Daniel E.
dc.creatorMédard, Muriel
dc.creatorStojanovic, Milica
dc.date2009-03-25
dc.date.accessioned2026-07-07T12:56:34Z
dc.date.available2026-07-07T12:56:34Z
dc.descriptionWe 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.
dc.description5 pages, 5 figures, 2 tables, Submitted to ISIT 2009
dc.identifierhttps://arxiv.org/abs/0903.4434
dc.identifierhttp://arxiv.org/abs/0903.4434
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224625
dc.subjectInformation Theory
dc.titleRandom Linear Network Coding for Time-Division Duplexing: Queueing Analysis
dc.typetext

Files

Collections

arXiv