Intersession network coding for two simple multicast sessions

45th Annual Allerton Conference on Communication, Control, and Computing 2007

Volumn 2, Issue , 2007, Pages 682-689

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

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATION THEORY; DIRECTED GRAPHS;

DESTINATION NODES; DIRECTED ACYCLIC GRAPH (DAG); INTER-SESSION NETWORK CODING; INTERMEDIATE NODE; MULTICAST SESSIONS; MULTIPLE DESTINATIONS; OPTIMAL NETWORKS; ROUTING PROBLEMS;

NETWORK CODING;

EID: 84940665875     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. V. Guruswami, B. Shepherd, R. Rajaraman, and M. Yannakakis, "Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, " in Proc. 31st Annual ACM Symp. on Theory of Computing (STOC), 1999, pp. 19-28.
2. 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.
3. R. Koetter and M. Medard, "An algebraic approach to network coding, " IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, October 2003.
4. Z. Li and B. Li, "Network coding in undirected networks, " in Proc. 38th Conf. Inform. Sciences and Systems. Princeton, NJ, USA, March 2004.
5. 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.
6. R. Dougherty, C. Freiling, and K. Zeger, "Insufficiency of linear coding in network information flow, " IEEE Trans. Inform. Theory, vol. 51, no. 8, pp. 2745-2759, August 2005.
7. A. Lehman, "Network coding, " Ph.D. dissertation, MIT, 2005.
8. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow, " in Proc. 15th ACM Symp. Parallel Algorithms and Architectures. San Diego, CA, USA, June 2003.
9. 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.
10. N. Harvey, R. Kleinberg, and A. Lehman, "On the capacity of informa-tion network, " IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2345-2364, June 2006.
11. 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.
12. 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.
13. 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.
14. 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.
15. D. Traskov, N. Ratnakar, D. Lun, R. Koetter, and M. Medard, "Network coding for multiple unicasts: An approach based on linear optimization, " in Proc. Int'l Symp. Inform. Theory. Seattle, USA, July 2006.
16. Y. Wu, "On constructive multi-source network coding, " in Proc. Int'l Symp. Inform. Theory. Seattle, USA, July 2006.
17. C.-C. Wang and N. Shroff, "Beyond the butterfly - A graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions, " in Proc. Int'l Symp. Inform, Theory. Nice, France, June 2007.
18. T. Ho, D. Karger, M. Medard, and R. Koetter, "Network coding from a network flow perspective, " in Proc. Int'l Symp. Inform, Theory. Yokohama, Kanagawa, Japan, 2003.
19. A. Khreishah, C.-C. Wang, and N. Shroff, "An optimization-based rate control for communication networks with inter-session network coding, " in Proc. IEEE Infocom, 2007, submission preprint.
20. S. Fortune, J. Hopcroft, and J. Wyllie, "The directed subgraph home-omorphism problem, " Theoretical Computer Science, vol. 10, pp. 111-121, 1980.
21. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding, " IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 829-848, March 2006.
22. R. Diestel, Graph Theory. New York: Springer-Verlag Heidelberg, 2005.