Provisioning virtual private networks under traffic uncertainty

Authors:
A. Altın;E. Amaldi;P. Belotti;M. Ç. Pınar
Affiliations:
Department of Industrial Engineering, Bilkent University, Ankara, Turkey;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy;Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy;Department of Industrial Engineering, Bilkent University, Ankara, Turkey
Venue:
Networks - Special Issue on Multicommodity Flows and Network Design
Year:
2007

Citing 0
Cited 13

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

ACM SIGACT News
The VPN conjecture is true

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

INFORMS Journal on Computing
A flexible auction model for virtual private networks

NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
An exact algorithm for robust network design

INOC'11 Proceedings of the 5th international conference on Network optimization
Cutset inequalities for robust network design

INOC'11 Proceedings of the 5th international conference on Network optimization
Affine recourse for the robust network design problem: between static and dynamic routing

INOC'11 Proceedings of the 5th international conference on Network optimization
Easy distributions for combinatorial optimization problems with probabilistic constraints

Operations Research Letters
Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations

Operations Research
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Networks
Models and algorithms for robust network design with several traffic scenarios

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The robust network loading problem with dynamic routing

Computational Optimization and Applications
The VPN Conjecture Is True

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic matrices, sufficient capacity has to be reserved on the links of the large underlying public network to support all possible traffic matrices while minimizing the total reservation cost. The problem admits several versions depending on the desired topology of the reserved links, and the nature of the traffic data uncertainty. We present compact linear mixed-integer programming formulations for the problem with the classical hose traffic model and for a less conservative robust variant relying on the traffic statistics that are often available. These flow-based formulations allow us to solve optimally medium-to-large instances with commercial MIP solvers. We also propose a combined branch-and-price and cutting-plane algorithm to tackle larger instances. Computational results obtained for several classes of instances are reported and discussed. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 100–115 2007