On the delay and throughput gains of coding in unreliable networks

IEEE Transactions on Information Theory

Volumn 54, Issue 12, 2008, Pages 5511-5524

  Eryilmaz, Atilla ^a   Ozdaglar, Asuman ^b   Médard, Muriel ^b   Ahmed, Ebad ^c  

^a Ohio State University   (United States)

^b USA   (United States)

^c Cornell University   (United States)

Author keywords

Broadcast; Delay analysis; Erasure channel; Maximum distance separable (MDS) codes; Network coding

Indexed keywords

ASYMPTOTIC ANALYSIS; BROADCASTING; CODES (SYMBOLS); ELECTRIC NETWORK TOPOLOGY; PROGRAMMING THEORY; TOPOLOGY;

ACCESS SCHEMES; ASYMPTOTIC EXPRESSIONS; CLOSED FORMS; CODING STRATEGIES; COMPLEX NETWORK TOPOLOGIES; DELAY ANALYSIS; DELAY PERFORMANCES; DIGITAL FOUNTAIN CODES; ERASURE CHANNEL; JOINT SCHEDULING; MAXIMUM-DISTANCE SEPARABLE (MDS) CODES; NETWORK CODING; NETWORK SETTINGS; NETWORK TOPOLOGIES; OPTIMAL TRANSMISSION STRATEGIES; PERFORMANCE ANALYSES; PERFORMANCE GAINS; RANDOM NETWORKS; SYSTEM PARAMETERS; THROUGHPUT GAINS; TRANSMISSION STRATEGIES;

WIRELESS NETWORKS;

EID: 57349116924     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2006454     Document Type: Article

References (24)

1. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
3. S. Bhadra and S. Shakkottai, "Looking at large networks: Coding vs queueing.," in Proc. IEEE INFOCOM, Barcelona, Spain, 2006, pp. 1-12.
4. T. H. Gormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. London, U.K/: M.I.T. Press, McGraw-Hill, 2001.
5. A. Eryilmaz, A. Ozdaglar, and M. Médard, "On delay performance gains from network coding," in Proc. Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2006.
6. M. Ghaderi, D. Towsley, and J. Kurose, Reliability Benefit of Network Coding, Univ. Mass. Amherst, Comp. Sci. Dept., Tech. Rep., Feb. 2007.
7. P. J. Grabner and H. Prodinger, "Maximum statistics of n random variables distributed by the negative binomial distribution.," Combin., Probab. Comput., vol. 6, pp. 179-183, 1997.
8. T. Ho, "Networking From a Network Coding Perspective," Ph.D. dissertation, MIT, Cambridge, MA, 2004.
9. D. Katabi, S. Katti, W. Hu, H. Rahul, and M. Médard, "The importance of being opportunistic: On practical network coding for wireless environments," in Proc. Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2005.
10. D. Katabi, S. Katti, W. Hu, H. Rahul, and M. Médard, "On practical network coding for wireless environments," in Proc. IEEE Int. Zurich Seminar on Communications, Zurich, Switzerland, Feb. 2006, pp. 84-85.
11. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
12. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding.," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
13. D. S. Lun, M. Médard, R. Koetter, and M. Effros, "Further results on coding for reliable communication over packet networks," in Proc. IEEE Int. Symp. Reliable Communication Over Packet Networks, 2005, pp. 1848-1852, An extended version has been submitted to IEEE Trans. Inf. Theory.
14. D. S. Lun, P. Pakzad, C. Fragouli, M. Médard, and R. Koetter, "An analysis of finite-memory random linear coding on packet streams," in Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), Apr. 2006, pp. 1-6.
15. D. S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, "Achieving minimum cost multicast: A decentralized approach based on network coding," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, pp. 1607-1617.
16. D. Nguyen, T. Nguyen, and B. Bose, "Wireless broadcasting using network coding," in Proc. 3rd Workshop on Network Coding, Theory and Applications (NeetCod), San Diego, CA, Jan. 2007.
17. R. B. Paris and D. Kaminski, Asymptotics and Mellin-Barnes Integrals Volume 85 of Encyclopedia of Mathematics and Its Applications. Cambridge, U.K.: Cambridge Univ. Press, 2001.
18. S Bhadra, S. Shakkottai, and P. Gupta, "Min-cost selfish multicast with network coding," IEEE Trans. Inf. Theory, vol. 52, no. 11, pp. 5077-5087, Nov. 2006.
19. B. Shrader and A. Ephremides, "On the queueing delay of a multicast erasure channel.," in IEEE Inf. Theory Workshop (ITW), Ounta del Este, Uruguay, Oct. 2006, pp. 423-427.
20. J. Sundararajan, D. Shah, and M. Méddard, Queueing Advantages of Network Coding MIT, Cambridge, MA, Tech. Rep., 2007.
21. L. Tassiulas and A. Ephremides, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Trans. Inf. Theory vol. 39, no. 2, pp. 466-478, Mar. 1993.
22. B. S. Tsybakov, "File transmission over wireless fast fading downlink," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2323-2337, Aug. 2002.
23. Y. Wu, "Network coding for multicasting," Ph.D. dissertation, Princeton Univ., Princeton, NJ, Nov. 2005.
24. Y. Xi and E. M. Yeh, "Distributed algorithms for minimum cost multicast with network coding in wireless networks," in Proc. 2nd Workshop on Network Coding, Theory, and Applications, Boston, MA, Apr. 2006.