Beyond the butterfly - A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 121-125

  Wang, Chih Chun ^a   Shroff, Ness B ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK CODING;

CYBERNETICS; GRAPH THEORY; INFORMATION THEORY; LINEAR NETWORKS; ROUTING ALGORITHMS; TECHNICAL PRESENTATIONS;

COMPUTER NETWORKS;

EID: 51649105182     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557214     Document Type: Conference Paper

References (18)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
2. Z. Li and B. Li, "Network coding in undirected networks," in Proc. 38th Conf. Inform. Sciences and Systems. Princeton, NJ, USA, March 2004.
3. S.-Y. R. Li, R. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inform. Theory, vol. 49, no. 2, pp. 371-381, Feb. 2003.
4. Z. Li and B. Li, "Network coding: the case of multiple unicast sessions," in Proc. 42nd Annual Allerton Conf. on Comm., Contr., and Computing. Monticello, Illinois, USA, Sept. 2004.
5. N. Harvey, R. Kleinberg, and A. Lehman, "On the capacity of information network," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2345-2364, June 2006.
6. X. Yan, J. Yang, and Z. Zhang, "An outer bound for multisource multisink network codign with minimum cost consideration," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2373-2385, June 2006.
7. L. Song, R. Yeung, and N. Cai, "Zero-error network coding for acyclic networks," IEEE Trans. Inform. Theory, vol. 49, no. 12, pp. 3129-3139, Dec. 2003.
8. K. Jain, V. Vazirani, R. Yeung, and G. Yuval, "On the capacity of multiple unicast sessions in undirected graphs," in Proc. Int'l Symp. Inform. Theory. Seattle, USA, July 2006.
9. G. Gramer and S. Savari, "Edge-cut bounds on network coding rates," Journal of Network and Systems Management, vol. 14, no. 1, pp. 49-67, March 2006.
10. D. Traskov, N. Ratnakar, D. Lun, R. Koetter, and M. Médard, "Network coding for multiple unicasts: An approach based on linear optimization," in Proc. Int'l Symp. Inform. Theory. Seattle, USA, July 2006.
11. Y. Wu, "On constructive multi-source network coding," in Proc. Int'l Symp. Inform. Theory. Seattle, USA, July 2006.
12. N. Harvey, K. Jain, L. Lau, C. Nair, and Y. Wu, "Conservative network coding," in Proc. 44th Annual Allerton Conf. on Comm., Contr., and Computing. Monticello, IL, Sept. 2003.
13. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph home - omorphism problem," Theoretical Computer Science, vol. 10, pp. 111-121, 1980.
14. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, October 2003.
15. T. Ho, D. Karger, M. Médard, and R. Koetter, "Network coding from a network flow perspective," in Proc. Int'l Symp. Inform. Theory. Yokohama, Kanagawa, Japan, 2003.
16. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 829-848, March 2006.
17. A. Eryilmaz and D. Lun, "Control for inter-session network coding," in Proc. Workhop on Network Coding, Theory & Applications, Jan. 2007.
18. A. Lehman, "Network coding," Ph.D. dissertation, MIT, 2005.