Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding

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 [8]. 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.

[1]  R. Koetter,et al.  An Analysis of Finite-Memory Random Linear Coding on Packet Streams , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[2]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[3]  Erol Gelenbe,et al.  Queueing performance under Network Coding , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[4]  A. Ephremides,et al.  On the queueing delay of a multicast erasure channel , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

[5]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Armand M. Makowski,et al.  Queueing models for systems with synchronization constraints , 1989, Proc. IEEE.

[7]  Devavrat Shah,et al.  ARQ for network coding , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Anthony Ephremides,et al.  A queueing model for random linear coding , 2007, MILCOM 2007 - IEEE Military Communications Conference.

[9]  Anthony Ephremides,et al.  Stable Throughput for Multicast With Random Linear Coding , 2011, IEEE Transactions on Information Theory.

[10]  Christina Fragouli,et al.  On Feedback for Network Coding , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[11]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[12]  Devavrat Shah,et al.  On queueing in coded networks - queue size follows degrees of freedom , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[13]  Joong Bum Rhim,et al.  Fountain Codes , 2010 .

[14]  Anthony Ephremides,et al.  Stability analysis of random linear coding across multicast sessions , 2008, 2008 IEEE International Symposium on Information Theory.