The multimessage unicast capacity region for bidirectional ring networks

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 763-766

  Savari, Serap A ^a   Kramer, Gerhard ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIDIRECTIONAL RING NETWORKS; MULTICOMMODITY FLOW PROBLEM;

CHANNEL CAPACITY; NETWORK ROUTING; PROBLEM SOLVING; SET THEORY;

TELECOMMUNICATION NETWORKS;

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

References (15)

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. T. M. Cover and J. A. Thomas, Elements of Information Theory, New York: Wiley, 1991.
3. T. S. Han and K. Kobayashi, "A new achievable rate region for the interference channel," IEEE Trans. Inform Theory, vol. IT-27, pp. 4960, Jan. 1981.
4. 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.
5. 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.
6. 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.
7. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Network and Systems Management, vol. 14, no. 1, March 2006.
8. H. Okamura and P. D. Seymour, "Multicommodity flows in planar graphs," J. Combin. Theory, Series B 31, pp. 75-81, 1981.
9. 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.
10. N. Ratnakar and G. Kramer, "The multicast capacity of deterministic relay networks with no interference," IEEE Trans. Inf. Theory, vol. 52, no. 6, June 2006.
11. A. Schrijver, Combinatorial Optimization, New York: Springer, 2003.
12. A. Schrijver, P. Seymour, and P. Winkler, "The ring loading problem," SIAM Review, vol. 41, no. 4, pp. 777-791, 1999.
13. C.E. Shannon, "Two-way communication channels," in Proc. 4th Berkeley Symp. on Mathematical Statistics and Probability, J. Neyman, Ed., Berkeley, CA, 1961, vol. 1, pp. 611-644, Univ. Calif. Press,
14. 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.
15. G. Wilfong and P. Winkler, "Ring routing and wavelength translation," Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '98), pp. 333-341, 1998.