Domination between traffic matrices

Mathematics of Operations Research

Volumn 33, Issue 1, 2008, Pages 91-96

  Oriolo, Gianpaolo ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Multicommodity flows; Network design; Robust optimization

Indexed keywords

CAPACITY RESERVATIONS; MULTICOMMODITY FLOWS; NETWORK DESIGN; ROBUST OPTIMIZATION; TRAFFIC MATRICES;

TELECOMMUNICATION TRAFFIC;

EID: 61349145730     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1070.0280     Document Type: Article

References (15)

1. Applegate, D., E. Cohen. 2003. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. Proc. ACM SIGCOMM, Karlsruhe, Germany, 313-324.
2. Azar, Y., E. Cohen, A. Fiat, H. Kaplan, H. Räcke. 2004. Optimal oblivious routing in polynomial time. J. Comput. System Sci. 69(3) 383-394.
3. Ben-Ameur, W., H. Kerivin. 2005. Routing of uncertain demands. Optim. Engrg. 3 283-313.
4. Bertsimas, D., M. Sim. 2003. Robust discrete optimization and network flows. Math. Programming 98(1-3) 49-71.
5. Chekuri, C., G. Oriolo, M. G. Scutellá, F. B. Shepherd. 2005. Hardness of robust network design. 50(1) 50-54. [An extended abstact appeared in Proc. INOC, 2005, Lisbon, Portugal, 455-461.]
6. Duffield, N. G., P. Goyal, A. G. Greenberg, P. P. Mishra, K. K. Ramakrishnan, J. E. van der Merwe. 1999. A flexible model for resource management in virtual private networks. Proc. ACM SIGCOMM, Cambridge, MA, 95-108.
7. Eaves, B. C., R. M. Freund. 1982. Optimal scaling of balls and polyhedra. Math. Programming 23 138-147.
8. Eisenbrand, F., F. Grandoni, G. Oriolo, M. Skutella. 2005. New approaches for virtual private network design. 32nd Proc. ICALP, Lisbon, Portugal, 1151-1162.
9. Fingerhut, J. A., S. Suri, J. S. Turner. 1997. Designing least-cost nonblocking broadband networks. J. Algorithms 24(2) 287-309.
10. Gupta, A., J. Kleinberg, A. Kumar, R. Rastogi, B. Yener. 2001. Provisioning a virtual private network: A network design problem for multicommodity flow. 33rd Proc. STOC, Heraklion, Crete, Greece, 389-398.
11. Iri, M. 1970. On an extension of the max-flow min-cut theorem for multicommodity flows. J. Oper. Res. Soc. Japan 13 129-135.
12. Italiano, G., S. Leonardi, G. Oriolo. 2006. Design of trees in the hose model: The balanced case. Oper: Res. Lett. 34(6) 601-606.
13. Kleinberg, J. 1996. Single-source unsplittable flow. 37th Proc. FOCS, Burlington, VT, 68-77.
14. Onaga, K., O. Kakusho. 1970. On feasibility conditions of multicommodity flows in networks. IEEE Trans. Circuit Theory 18(4) 425-429.
15. Oswald, P., F. B. Shepherd, P. Winzer, M. Zirngibl. 2005. Robust network design and selective randomized load balancing. 31st Proc. ECOC, Glasgow, UK, 1-23.