Math @ Duke

Publications [#319373] of Henry Pfister
Papers Published
 Parag, P; Chamberland, JF; Pfister, HD; Narayanan, KR, On the queueing behavior of random codes over a gilbertelliot erasure channel,
Ieee International Symposium on Information Theory Proceedings
(August, 2010),
pp. 17981802, IEEE, ISBN 9781424469604 [doi]
(last updated on 2019/07/19)
Abstract: This paper considers the queueing performance of a system that transmits coded data over a timevarying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters. This gives a framework that allows a rigorous analysis of the queue as a function of the code rate. Most prior work in this area either ignores blocklength (e.g., fluid models) or assumes errorfree communication using finite codes. This work enables one to determine when such assumptions provide good, or bad, approximations of true behavior. Moreover, it offers a new approach to optimize parameters and evaluate performance. This can be valuable for delaysensitive systems that employ short block lengths. © 2010 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

