A multimessage capacity region for undirected ring networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 1091-1095

  Yazdi, S M Sadegh Tabatabaei ^a   Savari, Serap A ^a   Farnoud, Farzad ^b   Kramer, Gerhard ^c  

^a University of Michigan   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; INFORMATION-THEORY; INTERNATIONAL SYMPOSIUM; MULTICAST SESSIONS;

COMPUTER NETWORKS;

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

References (17)

1. R. Ahlswede, N. Cai, S.-Y .R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol. 46, pp. 1204-1216, July 2000.
2. U. Black, Optical Networks: Third Generation Transport Systems, New Jersey: Prentice Hall PTR, 2002.
3. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, 1991.
4. R. C. Elsenpeter and T. J. Velte, Optical Networking: A Beginner's Guide, Berkeley: McGraw-Hill/Osborne, 2002.
5. M. Iri, "On an extension of the maximum-flow minimum-cut theorem to multicommodity flows," J. Operations Research Soc. of Japan, vol. 13, no. 3, pp. 129-135, Jan. 1970.
6. G. Kramer and S. A. Savari, "On networks of two-way channels," in A. Ashikhmin, A. Barg, eds., DIMACS Workshop on Algebraic Coding Theory and Information Theory, (December 15-18, 2003, Rutgers University, Piscataway, NJ), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 68, pp. 133-143, American Mathematical Society, Rhode Island, 2005.
7. G. Kramer and S. A. Savari, "Progressive d-separating edge set bounds on network coding rates," Proc. 2005 IEEE Int. Symp. Inform. Theory, (Adelaide, Australia), pp. 1588-1592, Sept. 4-9 2005.
8. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Network and Systems Management, vol. 14, no. 1, March 2006.
9. N.J.A. Harvey, R. Kleinberg and A.R. Lehman, "On the capacity of information networks," IEEE Trans. Inform. Theory, vol. 52, pp. 2345-2364, June 2006.
10. Z. Li and B. Li, "Network coding: the case of multiple unicast sessions," Proc. 42nd Annual Allerton Conf. on Communication, Control and Computing, (Monticello, IL), September, 2004.
11. H. Okamura and P. D. Seymour, "Multicommodity flows in planar graphs," J. Combin. Theory, Series B 31, pp. 75-81, 1981.
12. K. Onaga and O. Kakusho, "On feasibility conditions of multicommodity flows in networks," IEEE Trans. Circuit Theory, vol. CT-18, no. 4, pp. 425-429, July 1971.
13. S. A. Savari and G. Kramer, "A Study of Ring Networks," Invited presentation, 2006 IEEE Communication Theory Workshop, Dorado, Puerto Rico, May 24, 2006.
14. S. A. Savari and G. Kramer, "The Multimessage Unicast Capacity Region for Bidirectional Ring Networks," Proc. 2006 IEEE Int. Symp. Inform. Theory, Seattle, WA, July 2006.
15. A. Schrijver, P. Seymour, and P. Winkler, "The ring loading problem," SIAM Review, vol. 41, no. 4, pp. 777-791, 1999.
16. R. Vachani, A. Shulman, P. Kubat, and J. Ward, "Multicommodity flows in ring networks," INFORMS J. Computing, vol. 8, no. 3, pp. 235-242, Summer 1996.
17. Gunter M. Ziegler, Lectures on Polytopes, New York: Springer-Verlag, 1995.