Journal article
Delay on Broadcast Erasure Channels Under Random Linear Combinations
IEEE transactions on information theory, v 63(3), pp 1631-1661
Mar 2017
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 q = (q 1 ,..., 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 c → ∞) 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 n → ∞). Several results are new, some results are extensions of existing results, and some results are the proofs of known results using new (probabilistic) proof techniques.
Metrics
Details
- Title
- Delay on Broadcast Erasure Channels Under Random Linear Combinations
- Creators
- Nan Xie - Drexel UniversitySteven Weber - Drexel University
- Publication Details
- IEEE transactions on information theory, v 63(3), pp 1631-1661
- Publisher
- IEEE
- Grant note
- CCF-1016588 / National Science Foundation (10.13039/100000001)
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Electrical and Computer Engineering
- Web of Science ID
- WOS:000395822500019
- Scopus ID
- 2-s2.0-85013482317
- Other Identifier
- 991019167682804721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Web of Science research areas
- Computer Science, Information Systems
- Computer Science, Theory & Methods
- Engineering, Electrical & Electronic
- Mathematics, Applied