Multicast queueing delay: Performance limits and order-optimality of random linear coding
In this work we analyze the average queue backlog for transmission of a single multicast
flow consisting of M destination nodes in a wireless network. In the model we consider, the
channel between every pair of nodes is an independent identically distributed packet
erasure channel. We first develop a lower bound on the average queue backlog achievable
by any transmission strategy; for a single-hop multicast transmission, our bound indicates
that the queue size must scale as at least Ω (ln (M)). Next, we generalize this result to a …
flow consisting of M destination nodes in a wireless network. In the model we consider, the
channel between every pair of nodes is an independent identically distributed packet
erasure channel. We first develop a lower bound on the average queue backlog achievable
by any transmission strategy; for a single-hop multicast transmission, our bound indicates
that the queue size must scale as at least Ω (ln (M)). Next, we generalize this result to a …
Multicast Queueing Delay: Performance Limits and Order-Optimality of Random Linear Coding
In this work we analyze the average queue backlog for transmission of a single multicast
flow consisting of M destination nodes in a wireless network. In the model we consider the
channel between every pair of nodes an independent identically distributed packet erasure
channel. We first develop a lower bound on the average queue backlog achievable by any
transmission strategy for a single-hop multicast transmission, our bound indicates that the
queue size must scale as at least OmegaInM. Next, we generalize this result to a multihop …
flow consisting of M destination nodes in a wireless network. In the model we consider the
channel between every pair of nodes an independent identically distributed packet erasure
channel. We first develop a lower bound on the average queue backlog achievable by any
transmission strategy for a single-hop multicast transmission, our bound indicates that the
queue size must scale as at least OmegaInM. Next, we generalize this result to a multihop …
Showing the best results for this search. See all results