Bounding the coding advantage of combination network coding in undirected networks

IEEE Transactions on Information Theory

Volumn 58, Issue 2, 2012, Pages 570-584

  Maheshwar, Shreya ^a   Li, Zongpeng ^a   Li, Baochun ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Combination networks; Multicast; Network coding; Throughput critical networks; Tree packing

Indexed keywords

COST ADVANTAGES; INFORMATION FLOWS; LINEAR LINKS; LINK CAPACITIES; LINK COST; MULTICAST NETWORK; MULTICASTS; NATURAL STEPS; NETWORK TOPOLOGY; TIGHT BOUND; TREE PACKING; UNDIRECTED NETWORK;

CODES (SYMBOLS); ELECTRIC NETWORK TOPOLOGY; MULTICASTING; NETWORK CODING; THROUGHPUT;

COST REDUCTION;

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

References (37)

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. C. Fragouli, J.-Y. L. Boudec, and J. Widmer, "Network coding: An instant primer," ACM SIGCOMM Comput. Commun. Rev., vol. 36, no. 1, pp. 63-68, 2006.
3. Z. Li, B. Li, and L. C. Lau, "A constant bound on throughput improvement of multicast network coding in undirected networks," IEEE Trans. Inf. Theory, vol. 55, no. 3, pp. 997-1015, Mar. 2009.
4. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005.
5. Z. Li and B. Li, "Efficient and distributed computation of maximum multicast rates," in Proc. IEEE INFOCOM, 2005.
6. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Annu. Conf. Information Sciences and Systems (CISS), 2004.
7. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithm for network information flow," in Proc. 15th ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2003.
8. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On achieving optimal throughput with network coding," in Proc. IEEE INFOCOM, 2005.
9. A. Agarwal and M. Charikar, "On the advantage of network coding for improving network throughput," in Proc. IEEE Information Theory Workshop, Oct. 2004.
10. C. Fragouli and E. Soljanin, Network Coding Fundamentals. Boston, MA: NOW Publishers, 2007.
11. R. W. Yeung, S.-Y. R. Li, N. Cai, and Z. Zhang, Network Coding Theory. Boston, MA: NOW Publishers, 2006.
12. C. K. Ngai and R. W. Yeung, "Network coding gain of combination networks," in Proc. IEEE Information Theory Workshop, Oct. 2004.
13. M. Xiao, M. Médard, and T. Aulin, "A binary coding approach for combination networks and general erasure networks," in Proc. ISIT, 2007.
14. Z. Li, B. Li, and L. C. Lau, "On achieving optimal multicast throughput in undirected networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2467-2485, Jun. 2006.
15. J. Byrka, F. Grandoni, T. Rothvoss, and L. Sanità, "An improved LP-Based approximation for Steiner tree," in Proc. 42nd ACM Symp. Theory of Computing (STOC), 2010.
16. A. Smith, B. Evans, Z. Li, and B. Li, "The cost advantage of network coding in uniform combinatorial networks," in Proc. 1st IEEE Workshop on Wireless Network Coding (WiNC), 2008.
17. 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.
18. 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.
19. T. Ho, D. R. Karger,M.Médard, and R.Koetter, "Network coding from a network flow perspective," in Proc. ISIT, 2003.
20. 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, Jun. 2006.
21. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," in Proc. ISIT, 2005.
22. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2365-2372, Jun. 2006.
23. Y.Wu, P. A. Chou, and K. Jain, "A comparison of network coding and tree packing," in Proc. ISIT, 2004.
24. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman, "Comparing Network Coding with Multicommodity Flow for the κ-pairs Communication Problem," Tech. Rep. Comput. Sci. and Artific. Intell. Lab., Massachusetts Inst. Technol., 2004 [Online]. Available: http://theory.csail. mit.edu/nickh/Publications/Gaps/TR964.pdf
25. Z. Li and B. Li, "Network coding: The case of multiple unicast sessions," in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004.
26. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2345-2364, Jun. 2006.
27. N. J. A. Harvey and R. Kleinberg, "Tighter cut-based bounds for κ-pair communication problems," in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, 2005.
28. K. Jain, V. V. Vazirani, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2805-2809, Jun. 2006.
29. M. Langberg and M. Médard, "On the multiple unicast network coding conjecture," in Proc. 47th Annu. Allerton Conf. Communication, Control, and Computing, 2009.
30. J. Price and T. Javidi, "Network coding for resource redistribution in a unicast network," in Proc. 45th Annu. Allerton Conf. Communication, Control, and Computing, 2007.
31. S. Jaggi, M. Effros, T. Ho, and M. Médard, "On linear network coding," in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004.
32. Z. Li, "Min-cost multicast of selfish information flows," in Proc. IEEE INFOCOM, 2007.
33. D. B. Shmoys, E. Tardos, and K. Aardal, "Approximation algorithms for facility location problems," in Proc. 29th ACM Symp. Theory of Computing (STOC), 1997.
34. R. Koetter, M. Effros, and M. Médard, "On a theory of network equivalence," in Proc. IEEE Information Theory Workshop on Networking and Information Theory, 2009.
35. D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2608-2623, Jun. 2006.
36. K. Jain, M. Mahdian, and M. R. Salavatipour, "On the bidirected cut relaxation for the metric Steiner tree problem," in Proceedings of the 6th Annual ACM-SIAM Symp. Discrete Algorithms (SODA), 1999.
37. Y. Wu, "A unification of network coding and tree packing (Routing) theorems," in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004.