On the Shannon capacity and queueing stability of random access multicast

Details On the Shannon capacity and queueing stability of random access multicast On the Shannon capacity and queueing stability of random access multicast

2007-05-21

arxiv.org/abs/0705.3058v2

Computer Science

Information Theory

27 pages, 3 figures. Revisions to sections I, III, VII and App. A, B

Scientific paper

We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for interference and allows for multipacket reception, we first characterize the Shannon capacity region. We then consider a queueing-theoretic formulation and characterize the stable throughput region for two different transmission policies: a retransmission policy and random linear coding. Our results indicate that for large blocklengths, the random linear coding policy provides a higher stable throughput than the retransmission policy. Furthermore, our results provide an example of a transmission policy for which the Shannon capacity region strictly outer bounds the stable throughput region, which contradicts an unproven conjecture that the Shannon capacity and stable throughput coincide for random access systems.

Affiliated with

Also associated with

No associations

Rating

On the Shannon capacity and queueing stability of random access multicast does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Shannon capacity and queueing stability of random access multicast, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Shannon capacity and queueing stability of random access multicast will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-415237