On the multimessage capacity region for undirected ring networks

IEEE Transactions on Information Theory

Volumn 56, Issue 4, 2010, Pages 1930-1947

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

^a Texas AandM University   (United States)

^b University of Southern California ^*  (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

^d University of Illinois at Urbana Champaign   (United States)

Author keywords

Japanese theorem; Multicast sessions; Network capacity; Ring networks; Routing

Indexed keywords

ADJACENT VERTICES; ARBITRARY NETWORKS; CAPACITY REGIONS; ELIMINATION TECHNIQUES; FORM LINES; HALF SPACES; MULTICAST SESSIONS; MULTICASTS; NETWORK CAPACITY; NETWORK CODING; NETWORK GRAPH; RING NETWORKS; SHORTEST ROUTING; UNICAST;

INFORMATION THEORY;

MULTICASTING;

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

References (30)

1. 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.
2. U. Black, Optical Networks: Third Generation Transport Systems. Englewood Cliffs, NJ: Prentice-Hall PTR, 2002.
3. A. Brandstädt, V. B. Le, and J. P. Spinrad, "Graph classes: A survey," in SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial & Applied Mathematics. Philadelphia, PA: SIAM, 1999, vol.3.
4. T. Chan and A. Grant, "Dualities between entropy functions and network codes," IEEE Trans. Inf. Theory, vol.54, no.10, pp. 4470-4487, Oct. 2008.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. New York: Wiley, 2006.
6. R. C. Elsenpeter and T. J. Velte, Optical Networking: A Beginner's Guide. Berkeley, CA: McGraw-Hill/Osborne, 2002.
7. C. Fragouli, J. Widmer, and J. Y. Le Boudec, "Efficient broadcasting using network coding," IEEE/ACM Trans. Netw., vol.16, pp. 450-463, Apr. 2008.
8. N. J. A. Harvey, R. Kleinberg, and A. R. Lehman, "On the capacity of information networks," IEEE/ACM Trans. Netw., vol.14, pp. 2345-2364, Jun. 2006. (Pubitemid 43898896)
9. M. Iri, "On an extension of the maximum-flow minimum-cut theorem to multicommodity flows," J. Operat. Res. Soc. Jpn., vol.13, no.3, pp. 129-135, Jan. 1970.
10. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol.51, pp. 1973-1982, Jun. 2005.
11. A. Kakhbod, S. A. Savari, and S. M. S. T. Yazdi, "A study of the routing capacity regions of networks," in Proc. Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, Oct. 2008, pp. 2226-2230.
12. R.Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol.11, pp. 782-795, Oct. 2003.
13. G. Kramer and S. A. Savari, A. Ashikhmin and A. Barg, Eds., "On networks of two-way channels, DIMACSWorkshop on Algebraic Coding Theory and Information Theory (Dec. 15-18, 2003, Rutgers Univ., Piscataway, NJ)," in Proc. DIMACS Series in Discrete Math. Theoretical Comput. Sci., Providence, RI, 2005, vol.68, pp. 133-143.
14. G. Kramer and S. A. Savari, "Progressive separating edge set bounds on network coding rates," in Proc. 2005 IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 4-9, 2005, pp. 1588-1592.
15. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Netw. Syst. Manage., vol.14, no.1, Mar. 2006.
16. S. Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol.49, pp. 371-381, 2003.
17. Z. Li and B. Li, "Network coding: The case of multiple unicast sessions," in Proc. 42nd Ann. Allerton Conf. Commun., Control Comput., Monticello, IL, Sep. 2004.
18. 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. Toronto, Canada, 2004, ECE Technical Report.
19. H. Okamura and P. D. Seymour, "Multicommodity flows in planar graphs," J. Combin. Theory, Series B 31, pp. 75-81, 1981.
20. K. Onaga and O. Kakusho, "On feasibility conditions of multicommodity flows in networks," IEEE Trans. Circuit Theory, vol.CT-18, pp. 425-429, Jul. 1971.
21. S. A. Savari and G. Kramer, "A study of ring networks," in Invited Presentation, 2006 IEEE Commun. Theory Workshop, Dorado, Puerto Rico, May 24, 2006.
22. S. A. Savari and G. Kramer, "The multimessage unicast capacity region for bidirectional ring networks," in Proc. 2006 IEEE Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006.
23. M. Scheutzow, M. Reisslein, M. Maier, and P. Seeling, "Multicast capacity of packet-switched ring WDM networks," IEEE Trans. Inf. Theory, vol.54, pp. 623-644, Feb. 2008.
24. A. Schrijver, Theory of Linear and Integer Programming. New York: Wiley, 1998.
25. A. Schrijver, P. Seymour, and P.Winkler, "The ring loading problem," SIAM Rev., vol.41, no.4, pp. 777-791, 1999.
26. S. M. S. T. Yazdi, S. A. Savari, K. Carlson(Talaska), and G. Kramer, "The capacity region of a collection of multicast sessions in an undirected ring network," in Proc. Int. Workshop on Netw. Coding (IWNC) as part of the 36th Int. Conf. Parallel Proc. (ICPP), Xian, China, Sep. 10-14, 2007.
27. S. M. S. T. Yazdi, S. A. Savari, F. Farnoud, and G. Kramer, "A multimessage capacity region for undirected ring networks," in Proc. 2007 IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007.
28. R. Vachani, A. Shulman, P. Kubat, and J. Ward, "Multicommodity flows in ring networks," INFORMS J. Computing, vol.8, no.3, pp. 235-242, 1996.
29. J. G.Wardrop, "Some theoretical aspects of road traffic research," Proc. Inst. Civil Eng., vol.1, pt. II, pp. 325-378, 1952.
30. G. M. Ziegler, Lectures on Polytopes. New York: Springer-Verlag, 1995.