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

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 462-468

  Cogill, Randy ^a   Shrader, Brooke ^b  

^a University of Virginia   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING STRATEGY; DESTINATION NODES; LINEAR CODING; LINEAR NETWORK CODING; LOWER BOUNDS; MULTICAST FLOW; MULTICASTS; PACKET CODING; PACKET ERASURE CHANNELS; QUEUE LENGTHS; QUEUE SIZE; SOURCE NODES; TRANSMISSION STRATEGIES; UPPER BOUND;

INFORMATION THEORY; MULTICASTING;

QUEUEING THEORY;

EID: 77949648163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394766     Document Type: Conference Paper

References (15)

1. O. Abdelrahman and E. Gelenbe. Queueing models for network coding. IEEE Information Theory Workshop, 2009.
2. S. Asmussen. Applied Probability and Queues. Springer, 2003.
3. F. Baccelli and A. M. Makowski. Queueing models for systems with synchronization constraints. Proceedings of the IEEE, 77(1):138-161, 1989.
4. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. Proceedings of ACM SIGCOMM 98, 1998.
5. R. Cogill, B. Shrader, and A. Ephremides. Stability analysis of random linear coding across multicast sessions. Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008.
6. R. Cogill, B. Shrader, and A. Ephremides. Stable throughput for multicast with random linear coding. Submitted, 2008.
7. C. Fragouli, D. Lun, M. Medard, and P. Pakzad. On feedback for network coding. Proceedings of the 2007 Conference on Information Sciences and Systems, 2007.
8. T. Ho, R. Koetter, M. Medard, D.R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. Proceedings of the IEEE International Symposium on Information Theory, 2003.
9. D.S. Lun, P. Pakzad, C. Fragouli, M. Medard, and R. Koetter. An analysis of finite-memory random linear coding on packet streams. Proceedings of the Fourth International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt06), 2006.
10. D.J.C. MacKay. Fountain codes. Proceedings of the Fourth IEE Workshop on Discrete Event Systems (WODES98), 1998.
11. B. Shrader and A. Ephremides. On the queueing delay of a multicast erasure channel. Proceedings of the IEEE Information Theory Workshop, 2006.
12. B. Shrader and A. Ephremides. A queueing model for random linear coding. IEEE Military Communications Conference (MILCOM), 2007.
13. J. Sundararajan, D. Shah, and M. Medard. Queueing advantages of network coding. MIT LIDS Technical Report, 2007.
14. J.K. Sundararajan, D. Shah, and M. Medard. On queueing in coded networks - queue size follows degrees of freedom. Proceedings of the 2007 IEEE Workshop on Information Theory for Wireless Networks, 2007.
15. J.K. Sundararajan, D. Shah, and M. Medard. ARQ for network coding. Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008.