Provisioning virtual private networks under traffic uncertainty

DOI10.1002/NET.20145zbMath1131.90012OpenAlexW4229690180MaRDI QIDQ3418126

Edoardo Amaldi, Ayşegül Altın, Pietro Belotti, Mustafa Çelebi Pinar

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/27113

zbMATH Keywords

cutting planesnetwork designbranch and pricetraffic uncertaintyvirtual private networksrobust optimization mixed-integer linear programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (27)

Single-commodity robust network design with finite and hose demand sets ⋮ Single-commodity robust network design problem: complexity, instances and heuristic solutions ⋮ The robust network loading problem with dynamic routing ⋮ A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Robust energy-aware routing with redundancy elimination ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Robust network design: Formulations, valid inequalities, and computations ⋮ Affine recourse for the robust network design problem: Between static and dynamic routing ⋮ OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ A robust optimization model for distribution network design under a mixed integer set of scenarios ⋮ Generalized hose uncertainty in single-commodity robust network design ⋮ Easy distributions for combinatorial optimization problems with probabilistic constraints ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ Robust optimal discrete arc sizing for tree-shaped potential networks ⋮ Robust transshipment problem under consistent flow constraints ⋮ A comparison of routing sets for robust network design ⋮ The asymmetric VPN tree problem: polyhedral results and Branch-and-Cut ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Experiments on virtual private network design with concave capacity costs ⋮ Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Robust routing and optimal partitioning of a traffic demand polytope ⋮ Designing networks with resiliency to edge failures using two-stage robust optimization ⋮ Exploring the Tractability of the Capped Hose Model ⋮ Virtual private network design over the first Chvátal closure

Cites Work

• Unnamed Item
• Simpler and better approximation algorithms for network design
• Provisioning a virtual private network
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

This page was built for publication: Provisioning virtual private networks under traffic uncertainty