A unification of network coding and tree-packing (routing) theorems

IEEE Transactions on Information Theory

Volumn 52, Issue 6, 2006, Pages 2398-2409

  Wu, Yunnan ^a   Jain, Kamal ^a   Kung, Sun Yuan ^b  

^a MICROSOFT RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

Flow; Multicast; Network coding; Routing; Steiner tree

Indexed keywords

CHANNEL CAPACITY; ENCODING (SYMBOLS); GRAPH THEORY; MULTICASTING; TELECOMMUNICATION LINKS; THEOREM PROVING; TREES (MATHEMATICS);

MULTICAST CAPACITY; NETWORK CODING; STEINER TREE; TREE-PACKING THEOREMS;

TELECOMMUNICATION NETWORKS;

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

References (29)

1. Y. Wu and S.-Y. Kung, "Reduced-complexity network coding for multicasting over ad hoc networks," in Proc. Int. Conf. Acoust., Speech, Signal Processing, Philadelphia, CA, Mar. 2005.
2. K. Menger, "Zur allgemeinen Kurventheorie," Fund. Math., vol. 10, pp. 95-115, 1927.
3. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. New York: Springer, 2003.
4. L. R. Ford and D. R. Fulkerson, "On the max-flow min-cut theorem of networks," in Linear Inequalities and Related Systems, H. Kuhn and A. Tucker, Eds. Princeton, NJ: Princeton University Press, 1956, vol. 38, Annals of Mathematics Studies, pp. 215-221.
5. J. Edmonds, "Edge-disjoint branchings," in Combinatorial Algorithms, R. Rustin, Ed. New York: Academic, 1973, pp. 91-96.
6. L. Lovász, "Connectivity in digraphs," J. Combin. Theory B, vol. 15, pp. 174-177, 1973.
7. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, pp. 1204-1216, Jul. 2000.
8. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing steiner trees," in Proc. 14th Symp. Discrete Algorithms (SODA), AUTHOR: PLEASE PROVIDE LOCATION - ED. 2003.
9. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. IT-49, pp. 371-381, Feb. 2003.
10. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, pp. 782-795, Oct. 2003.
11. P. A. Chou, Y. Wu, and K. Jain, "Practical network coding," in Proc. 41st Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 2003.
12. T. Ho, R. Koetter,M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. Int. Symp. Inf. Theory, Yokohama, Japan, Jun. 2003.
13. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. 41st Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 2003.
14. S. Jaggi, P. A. Chou, and K. Jain, "Low complexity optimal algebraic multicast codes," in Proc. Int. Symp. Inf. Theory, Yokohama, Japan, Jun. 2003.
15. P. Sander, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. Symp. Parallel Algorithms Architect. (SPAA), San Diego, CA, Jun. 2003, pp. 286-294.
16. N. J. A. Harvey, D. R. Karger, and K. Murota, "Deterministic network coding by matrix completion," in Proc. ACM-SIAM Symp. Discrete Algorithms (SODA 05), Vancouver, Canada, Jan. 2005.
17. R. E. Tarjan, "A good algorithm for edge-disjoint branching," Inf. Process. Lett., vol. 3, no. 2, pp. 51-53, Nov. 1974.
18. L. Lovász, "On two minimax theorems in graph theory," J. Combin. Theory B, vol. 21, pp. 96-103, 1976.
19. A. Frank, "Kernel systems of directed graphs," Acta Sci. Math., vol. 41, pp. 63-76, 1979.
20. W. Mader, "On n-edge-connected digraphs," Ann. Discrete Math., vol. 17, pp. 439-441, 1983.
21. P. Tong and E. L. Lawler, "A faster algorithm for finding edge-disjoint branchings," Inf. Process. Lett., vol. 17, no. 2, pp. 73-76, Aug. 1983.
22. H. Gabow, "A matroid approach to finding edge connectivity and packing arboresences," in Proc. 23rd ACM Symp. Theory Comput., 1991, pp. 112-122.
23. Y. Wu, K. Jain, and S.-Y. Kung, "A unification of Edmonds' graph theorem and Ahlswede et al's network coding theorem," in Proc. 42nd Allerton Conf. Commun., Contr. Comput., Monticello, IL, Oct. 2004.
24. L. Lovász, "On some connectivity properties of Eulerian graphs," Acta Math. Hungar., vol. 28, pp. 129-138, 1976.
25. W. Mader, "A reduction method of edge-connectivity in graphs," in Ann. Discrete Math., 1978, vol. 3, pp. 145-164.
26. W. Mader, "Konstruktion aller n-fach kantenzusammenhängenden digraphen," Eupropean J. Combin., vol. 3, pp. 63-67, 1982.
27. J. Bang-Jensen, A. Frank, and B. Jackson, "Preserving and increasing local edge-connectivity in mixed graphs," SIAM J. Discrete Math., vol. 8, no. 2, pp. 155-178, 1995.
28. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Annu. Conf. Inf. Sci. Syst. (CISS 2004), Princeton, NJ, Mar. 2004, pp. 257-262.
29. Z. Li, B. Li, D. Jiang, and L. C. Lau, "On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies," Univ. of Toronto, Dept. ECE, Tech. Rep., 2004.