Static and dynamic routing under disjoint dominant extreme demands

Authors:
A. Frangioni;F. Pascali;M. G. Scutellí
Affiliations:
Polo Universitario della Spezia, Via dei Colli 90, 19121 La Spezia, Italy;Department of Computer Science, Universitè Libre de Bruxelles, Boulevard du Triomphe CP 210/01, 1050 Bruxelles, Belgium;Dipartimento di Informatica, Universití di Pisa, Largo B. Pontecorvo 3, 56127 Pisa, Italy
Venue:
Operations Research Letters
Year:
2011

Citing 12
Cited 0

Designing least-cost nonblocking broadband networks

Journal of Algorithms
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Provisioning a virtual private network: a network design problem for multicommodity flow

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Networks new economical virtual private

Communications of the ACM - E-services: a cornucopia of digital offerings ushers in the next Net-based evolution
Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees

SIAM Journal on Computing
Hardness of robust network design

Networks
Routing and network design with robustness to changing or uncertain traffic demands

ACM SIGACT News
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

SIAM Journal on Discrete Mathematics
The VPN conjecture is true

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Domination Between Traffic Matrices

Mathematics of Operations Research
On improving optimal oblivious routing

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a special case of the robust network design problem where the dominant extreme points of the demand polyhedron have a disjoint support. In this case static and dynamic routing lead to the same optimal solution, both for the splittable and the unsplittable case. As a consequence, the robust network design problem with (splittable) dynamic routing is polynomially solvable, whereas it is co-NP-hard in the general case. This result applies to particular instances of the single-source Hose model.