On improving optimal oblivious routing

Authors:
Maria Grazia Scutellí
Affiliations:
Dipartimento di Informatica, Universití di Pisa, Italy
Venue:
Operations Research Letters
Year:
2009

Citing 4
Cited 2

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
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
Hardness of robust network design

Networks

Affine recourse for the robust network design problem: between static and dynamic routing

INOC'11 Proceedings of the 5th international conference on Network optimization
Static and dynamic routing under disjoint dominant extreme demands

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a generalization of the robust network design problem with oblivious routing is investigated, where the (uncertain) demands are served through two alternative routing templates. A mathematical programming model leading to tractable cases is presented, together with related algorithmic approaches. The proposed special cases strictly generalize the standard oblivious routing model.