Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding
Author(s)
Cogill, Randy; Shrader, Brooke E.
DownloadCogill-2009-Queue length analysis for multicast Limits of performance.pdf (168.7Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
In this work we analyze the average queue backlog at a source node serving a single multicast flow consisting of M destination nodes. In the model we consider, the channel between the source node and each receiver is an independent identically distributed packet erasure channel. We first develop a lower bound on the average queue backlog achievable by any transmission strategy; our bound indicates that the queue size must scale as at least
Ω(ln(M)). We then analyze the queue backlog for a strategy in which random linear coding is performed over groups of packets in the queue; this strategy is an instance of the random linear network coding strategy introduced in. We develop an upper bound on the average queue backlog for the packet-coding strategy to show that the queue size for this strategy scales as O(ln(M)). Our results demonstrate that in terms of the queue backlog, the packet coding strategy is order-optimal with respect to the number of receivers.
Date issued
2010-01Department
Lincoln LaboratoryJournal
47th Annual Allerton Conference on Communication, Control, and Computing, 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Cogill, R., and B. Shrader. “Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding.” Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on. 2009. 462-468. © 2009 IEEE
Version: Final published version
Other identifiers
INSPEC Accession Number: 11135166
ISBN
78-1-4244-5870-7