Cross-layer design of rateless random network codes for delay optimization

IEEE Transactions on Communications

Volumn 59, Issue 12, 2011, Pages 3311-3322

  Xiao, Ming ^a   Médard, Muriel ^b   Aulin, Tor ^c  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b Department of Electrical Engineering and Computer Science   (United States)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

cross layer design; delay; Network coding; optimization

Indexed keywords

CHANNEL CODE; CODE-WORDS; CROSS-LAYER APPROACH; CROSS-LAYER DESIGN; DECODING ERRORS; DELAY; DELAY MEASURES; DELAY OPTIMIZATION; DELAY PERFORMANCE; DETECTION ERROR; DETECTION ERROR PROBABILITY; FINITE TRANSMISSION TIME; IDENTICALLY DISTRIBUTED RANDOM VARIABLES; INFORMATION GENERATION; INFORMATION PACKETS; JOINT NETWORK; MIN-CUT; NETWORK CODES; OPTIMAL VALUES; PACKET LENGTH; PHYSICAL LAYERS; RANDOM METHODS; RANDOM NETWORK; SOURCE TO SINKS; TRANSMISSION ERROR; TRANSMISSION TIME;

CHANNEL CODING; CODES (SYMBOLS); DESIGN; ERROR DETECTION; NETWORK LAYERS; OPTIMIZATION; RANDOM VARIABLES;

NETWORK CODING;

EID: 84655176412     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2011.112311.100366     Document Type: Article

References (19)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, July 2000.
2. S. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
3. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, pp. 782-795, Oct. 2003.
4. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
5. D. Lun, M. Médard, R. Koetter, and M. Effros, "On coding for reliable communication over packet networks," Physical Commun., Mar. 2008.
6. M. Luby, "LT codes," in Proc. 2002 Annual IEEE Symposium on Foundations of Computer Science, pp. 271-282.
7. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, June 2006.
8. A. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 789-804, Mar. 2006.
9. M. Vehkaperä and M. Médard, "A throughput-delay trade-off in packetized systems with erasures," in Proc. 2005 IEEE Int. Sym. on Info. Theory, pp. 1858-1862.
10. A. Eryilmaz, A. Ozdaglar, and M. Médard, "On delay performance gains from network coding," in Proc. 2006 Annual Conference on Information Sciences and Systems, pp. 864-870.
11. A. Ramamoorthy, J. Shi, and R. Wesel, "On the capacity of network coding for random networks," IEEE Trans. Inf. Theory, vol. 51, no. 8, pp. 2878-2885, Aug. 2005.
12. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 2003 Annual Allerton Conference on Communication, Control, and Computing.
13. R. Gallager, Information Theory and Reliable Communication. John Wiley and Sons, 1968.
14. J. G. Proakis, Digital Communications, 4th edition. McGraw-Hill, 2000.
15. D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge University Press, 2005.
16. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 2004 Annu. ACM-SIAM Symp. Discrete Algorithms, pp. 142-150.
17. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput and alphabet size in network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2410-2424, 2006.
18. C. A. Floudas, P. Pardalos, C. Adjiman, et al., Handbook of Test Problems in Local and Global Optimization (Nonconvex Optimization and Its Applications). Springer Press, 1999.
19. I. Nowak, Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Springer Press, 2005.