paper

Delay on broadcast erasure channels under random linear combinations

arXiv:1310.4412 · doi:10.1109/TIT.2016.2634007

Abstract

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

arXiv comment31 pages, 8 figures, submitted on October 1, 2013 and accepted for publication on November 3, 2016 at IEEE Transactions on Information Theory. Preliminary version presented at ITA 2013. DOI: 10.1109/TIT.2016.2634007. Copyright transferred to IEEE. This is the last version uploaded by the authors prior to the IEEE proofing process

References in corpus (1)