Multicast queueing delay: Performance limits and order-optimality of random linear coding

IEEE Journal on Selected Areas in Communications

Volumn 29, Issue 5, 2011, Pages 1075-1083

  Cogill, Randy ^a   Shrader, Brooke ^b  

^a University of Virginia   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Mincut capacity; Multicast; Packet coding; Packet erasure network; Queue backlog; Queueing delay; Random linear coding

Indexed keywords

LINEAR CODING; MIN-CUT; MULTICASTS; PACKET CODING; QUEUE BACKLOG; QUEUEING DELAYS;

CODES (SYMBOLS); MULTICASTING; OPTIMIZATION; QUEUEING NETWORKS;

QUEUEING THEORY;

EID: 84055221984     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2011.110517     Document Type: Article

References (14)

1. O. Abdelrahman and E. Gelenbe. Queueing performance under network coding. Proc. 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. Proc. 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. Proc. ACM SIGCOMM, 1998.
5. R. Cogill and S. Lall. Suboptimality bounds in stochastic control: A queueing example. Proc. American Control Conference, 2006.
6. R. Cogill and B. Shrader. Queue length analysis for multicast: Limits of performance and achievable queue length with random linear coding. Proc. Allerton Conference on Communication, Control, and Computing, 2009.
7. R. Cogill, B. Shrader, and A. Ephremides. Stability analysis of random linear coding across multicast sessions. Proc. IEEE International Symposium on Information Theory, 2008.
8. R. Cogill, B. Shrader, and A. Ephremides, "Stable throughput for multicast with random linear coding," IEEE Trans. Inf. Theory, 57(1): 267-281, Jan. 2011.
9. A.F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros. Capacity of wireless erasure networks. IEEE Trans. Inf. Theory, 52(3):789-804, 2006. (Pubitemid 46444874)
10. A. Eryilmaz, A. Ozdaglar, and M. Medard. On delay performance gains from network coding. Proc. Conference on Information Sciences and Systems (CISS), 2006.
11. T. Ho, R. Koetter, M. Medard, D.R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. Proc. IEEE International Symposium on Information Theory, 2003.
12. D.S. Lun, P. Pakzad, C. Fragouli, M. Medard, and R. Koetter. An analysis of finite-memory random linear coding on packet streams. Proc. International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2006.
13. B. Shrader and A. Ephremides. A queueing model for random linear coding. Proc. IEEE Military Communications Conference (MILCOM), 2007.
14. J.K. Sundararajan, D. Shah, and M. Medard. ARQ for network coding. Proc. IEEE International Symposium on Information Theory, 2008.