Title :
Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding
Author :
Cogill, Randy ; Shrader, Brooke
Author_Institution :
Dept. of Syst. & Inf. Eng., Univ. of Virginia, Charlottesville, VA, USA
fDate :
Sept. 30 2009-Oct. 2 2009
Abstract :
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 ¿(1¿(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.
Keywords :
linear codes; queueing theory; radio receivers; random codes; M destination nodes; average queue backlog; average queue length analysis; multicast flow; packet erasure channel; packet-coding strategy; radio receiver; random linear network coding strategy; Delay; Information analysis; Laboratories; Network coding; Performance analysis; Queueing analysis; Systems engineering and theory; Throughput; Transmitters; Upper bound;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394766