Delay on Broadcast Erasure Channels Under Random Linear Combinations

DOI10.1109/TIT.2016.2634007MaRDI QIDQ5280858zbMATH OpenOpenAlexFDO

Authors Nan Xie, Steven Weber

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.4412

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Measures of information, entropy (94A17)

Abstract: We consider a transmitter broadcasting random linear combinations (over a field of size $d$) formed from a block of $c$ packets to a collection of $n$ receivers, where the channels between the transmitter and each receiver are independent erasure channels with reception probabilities $mathbfq=(q_1,ldots,q_n)$. We establish several properties of the random delay until all $n$ receivers have recovered all $c$ packets, denoted $Y_{n:n}^{(c)}$. First, we provide lower and upper bounds, exact expressions, and a recurrence for the moments of $Y_{n:n}^{(c)}$. Second, we study the delay per packet $Y_{n:n}^{(c)}/c$ as a function of $c$, including the asymptotic delay (as $coinfty$), and monotonicity (in $c$) properties of the delay per packet. Third, we employ extreme value theory to investigate $Y_{n:n}^{(c)}$ as a function of $n$ (as $noinfty$). Several results are new, some results are extensions of existing results, and some results are proofs of known results using new (probabilistic) proof techniques.

Cited in

(2)

• Sharp and simple bounds for the Erlang delay and loss formulae
• Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels

This page was built for publication: Delay on Broadcast Erasure Channels Under Random Linear Combinations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280858)