Provisioning virtual private networks under traffic uncertainty

DOI10.1002/NET.20145zbMATH Open1131.90012OpenAlexW4229690180MaRDI QIDQ3418126FDOQ3418126

Authors: Ayşegül Altın, E. Amaldi, Pietro Belotti, Mustafa Ç. Pınar 

Publication date: 2 February 2007

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• Provisioning a virtual private network: a network design problem for multicommodity flow
• From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
• Virtual private network design
• Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
• Automata, Languages and Programming

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) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Cites Work

• Title not available (Why is that?)
• Simpler and better approximation algorithms for network design
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks

Cited In (37)

• From uncertainty to nonlinearity: solving virtual private network via single-sink buy-at-bulk
• Title not available (Why is that?)
• Virtual private network bandwidth management with traffic prediction.
• Robust combinatorial optimization with knapsack uncertainty
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Robust routing and optimal partitioning of a traffic demand polytope
• 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
• Virtual private network design over the first Chvátal closure
• Robustness concepts for knapsack and network design problems under data uncertainty
• Single-commodity robust network design with finite and hose demand sets
• Single-commodity robust network design problem: complexity, instances and heuristic solutions
• Experiments on virtual private network design with concave capacity costs
• Multi-path routing versus tree routing for VPN bandwidth provisioning in the hose model
• Robust transshipment problem under consistent flow constraints
• Routing of uncertain traffic demands
• A capacitated hub location problem under hose demand uncertainty
• Robust optimal discrete arc sizing for tree-shaped potential networks
• Easy distributions for combinatorial optimization problems with probabilistic constraints
• Capacity planning in IP virtual private networks under mixed traffic
• A practicable robust counterpart formulation for decomposable functions: a network congestion case study
• Resource optimization algorithms for virtual private networks using the hose model
• Exploring the tractability of the capped hose model
• A comparison of routing sets for robust network design
• Robust network design: formulations, valid inequalities, and computations
• Robust energy-aware routing with redundancy elimination
• Provisioning a virtual private network: a network design problem for multicommodity flow
• Robust minimum cost flow problem under consistent flow constraints
• A robust optimization model for distribution network design under a mixed integer set of scenarios
• The robust network loading problem with dynamic routing
• Generalized hose uncertainty in single-commodity robust network design
• Title not available (Why is that?)
• Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
• Designing networks with resiliency to edge failures using two-stage robust optimization
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Affine recourse for the robust network design problem: between static and dynamic routing
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418126)