A study of the routing capacity regions of networks

Conference Record - Asilomar Conference on Signals, Systems and Computers

Volumn , Issue , 2008, Pages 2226-2230

  Kakhbod, Ali ^a   Savari, Serap A ^b   Yazdi, S M Sadegh Tabatabaei ^b  

^a UNIVERSITY OF MICHIGAN   (United States)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Linear programming; Multicast sessions; Network capacity; Routing

Indexed keywords

CAPACITY REGIONS; LINEAR INEQUALITIES; MULTICAST SESSIONS; NETWORK CAPACITY; NETWORK PARAMETERS; RING NETWORKS; ROUTING; UNICAST;

DYNAMIC PROGRAMMING; MULTICASTING;

LINEARIZATION;

EID: 70349695924     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.2008.5074831     Document Type: Conference Paper

References (16)

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. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger,"Network routing capacity," IEEE Trans. Inform. Theory, vol. 52,no. 3, pp. 777-788, Mar. 2006.
3. A. Frank, B. Shepherd, V. Tandon, and Z. Vegh,"Node-capacitated ring routing," Mathematics of Operations Research, vol. 27, no. 2, pp. 372-383, May 2002.
4. M. Grotschel, L. Lovasz, A. Schrijver Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1985.
5. T. C. Hu,"Multi-commodity network flows," Oper. Res., vol. 11, pp. 344-360, 1963.
6. 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, 1971.
7. G. Kramer and S. A. Savari, "Edge-cut bounds on network coding rates," J. Network Sys. Management, vol. 14, no. 1, pp. 49-67, March 2006.
8. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," Proc. 2005 IEEE Int. Symp. Inform. Theory, (Adelaide, Australia), pp. 1987-1991, Sept. 4-9 2005.
9. Network coding web page:"http://tesla.csl.uiuc.edu/koetter/NWC/ "
10. K. Onaga and O. Kakusho, "On feasibility conditions of multicommodity flows in networks," IEEE Trans. Circuit Theory, vol. CT-18, pp. 425-429, 1971.
11. 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.
12. A. Schrijver, Combinatorial Optimization, New York: Springer, 2003.
13. A. Schrijver, Theory of Linear and Integer Programming, New York: Wiley, 1998.
14. F. Shahrokhi and D. W. Matula, "The maximum concurrent flow problem," J. ACM, vol. 37, no. 2, pp. 318-334, 1990.
15. S. M. Tabatabaei Yazdi, S. A. Savari, K. Carlson (Talaska), and G. Kramer, " The capacity region of a collection of multicast sessions in undirected ring network," Proc. Int. Workshop on Network Coding (IWNC) as part of the 36th Int. Conf. Parallel Proc. (ICPP), Xian, China, Sept. 10-14, 2007.
16. S. M. Tabatabaei Yazdi, S. A. Savari, F. Farnoud, and G. Kramer, "A multimessage capacity region for undirected ring networks," Proc. 2007 IEEE Int. Symp. Inform. Theory, Nice, France, pp. 1091-1095, Jun. 24-29, 2007.