On average throughput and alphabet size in network coding

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2410-2424

  Chekuri, Chandra ^a   Fragouli, Christina ^b   Soljanin, Emina ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b EPFL   (Switzerland)

Author keywords

Linear programming integrality gap; Multicast; Network coding; Routing; Throughput

Indexed keywords

CHANNEL CAPACITY; ENCODING (SYMBOLS); GRAPH THEORY; LINEAR PROGRAMMING; MULTICASTING; RANDOM PROCESSES; TREES (MATHEMATICS); VECTORS;

CHANNEL CODING; LINEAR PROGRAMMING INTEGRALITY GAP; NETWORK CODING; VECTOR ROUTING;

TELECOMMUNICATION NETWORKS;

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

References (22)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000.
2. 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.
3. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Annu. Conf. Information Science and Systems (CISS), Princeton, NJ, Mar. 2004, pp. 257-262.
4. Y. Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 143.
5. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. 15th ACM Symp. Parallel Algorithms and Architectures (SPAA), San Diego, CA, Jun. 2003, pp. 286-294.
6. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," in Proc. 2004 IEEE Information Theory Workshop, San Antonio, TX, Oct. 2004, pp. 247-249.
7. L. Zosin and S. Khuller, "On directed steiner trees," in Proc. 13th Annu. ACM/SIAM Symp. Discrete Algorithms (SODA), San Francisco, CA, Jan. 2002, pp. 59-63.
8. E. Halperin, G. Kortsarz, R. Krauthgamer, A. Srinivasan, and N. Wang, "Integrality ratio for group steiner trees and directed steiner trees," in Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA , Baltimore, MD, Jan. 2003, pp. 275-284.
9. A. Rasala-Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), New Orleans, LA, Jan. 2004, pp. 142-150.
10. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow," IEEE Trans. Inf. Theory, submitted for publication.
11. C. Fragouli and E. Soljanin, "On average throughput benefits for network coding," in Proc. 42nd Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2004.
12. M. Luby, M. Mitzenmacher, A. S. D. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. ACM Symp. Theory of Computing (STOC), El Paso, TX, May 1997, pp. 150-159.
13. A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
14. C. Chekuri, C. Fragouli, and E. Soljanin, "On average throughput and alphabet size in network coding," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1593-1597.
15. S. Jaggi, P. Chou, and K. Jain, "Low complexity algebraic multicast network codes," in Proc IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003.
16. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. 41st Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003.
17. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, Mar. 2006.
18. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1986.
19. M. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Eds., Network Models. Amsterdam, The Netherlands: North-Holland, 1994.
20. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006.
21. V. F. Kolchin, B. A. Sevastianov, and V. P. Christiakov, Random Allocations. New York: Wiley, 1978.
22. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2386-2397, Jun. 2006.