Effects of the generation size and overlap on throughput and complexity in randomized linear network coding

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1111-1123

  Li, Yao ^a   Soljanin, Emina ^b   Spasojevic, Predrag ^a  

^a The State University of New Jersey   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Coupon collector's problem; Network coding; rateless codes

Indexed keywords

CODED PACKET; CONTENT DISTRIBUTION; COUPON COLLECTOR'S PROBLEM; DECODING FAILURE; LINEAR NETWORK CODING; LINK CAPACITIES; NETWORK CODING; RANDOM GENERATION; RATE-LESS CODES;

DECODING; INFORMATION THEORY; THROUGHPUT;

COMPUTATIONAL COMPLEXITY;

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

References (16)

1. T. Ho, R. Koetter,M. Medard, D. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE Int. Symp. Information Theory (ISIT'03), 2003, p. 442.
2. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in Proc. The 24th Annu. Joint Conf. IEEE Computer and Communications Societies (INFOCOM'05), Miami, FL, Mar. 2005, vol. 4, pp. 2235-2245.
3. Z. Liu, C. Wu, B. Li, and S. Zhao, "UUSee: Large-scale operational on-demand streaming with random network coding," in Proc. 30th IEEE Conf. Computer Communications (INFOCOM'10), San Diego, CA, Mar. 2010.
4. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003.
5. P. Maymounkov, N. Harvey, and D. S. Lun, "Methods for efficient network coding," in Proc. 44th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2006.
6. D. Silva, W. Zeng, and F. Kschischang, "Sparse network coding with overlapping classes," in Proc. Workshop on Network Coding, Theory, and Applications (NetCod'09), Lausanne, Switzerland, Jun. 2009, pp. 74-79.
7. A. Heidarzadeh and A. Banihashemi, "Overlapped chunked network coding," in Proc. IEEE Information Theory Workshop (ITW'10), Jan. 2010, pp. 1-5.
8. W. Feller, An Introduction to Probability Theory and Its Applications, 3rd ed. New York: Wiley, 1968, vol. 1, pp. 224-225.
9. C. Fragouli and E. Soljanin, Network Coding Applications, ser. Foundations and Trends in Networking. Hanover, MA: Now Publishers, Jan. 2008, vol. 2, pp. 146-147.
10. D. Newman and L. Shepp, "The double dixie cup problem," The Amer. Mathemat. Monthly, vol. 67, no. 1, pp. 58-61, Jan. 1960.
11. D. Foata and D. Zeilberger, "The collector's brotherhood problem using the Newman-Shepp symbolic method," Algebra Universalis, vol. 49, no. 4, pp. 387-395, 2003.
12. A. Boneh and M. Hofri, "The coupon-collector problem revisited- A survey of engineering problems and computational methods," Stochastic Models vol. 13, pp. 39-66, 1997 [Online]. Available: http://www.informaworld. com/10.1080/15326349708807412
13. P. Flajolet, D. Gardy, and L. Thimonier, "Birthday paradox, coupon collectors, caching algorithms and self-organizing search," Discrete Appl. Math., vol. 39, no. 3, pp. 207-229, 1992.
14. L. Flatto, "Limit theorems for some random variables associated with urn models," Ann. Probabil. vol. 10, no. 4, pp. 927-934, 1982 [Online]. Available: http://www.jstor.org/stable/2243548
15. A. N. Myers and H. S. Wilf, "Some new aspects of the coupon collector's problem," SIAM Rev., vol. 48, no. 3, pp. 549-565, 2006.
16. P. Erdös and A. Rényi, "On a classical problem of probability theory," Magyar Tud. Akad. Mat. Kutató Int. Közl., vol. 6, pp. 215-220, 1961.