Routing of uncertain traffic demands
From MaRDI portal
Publication:833385
DOI10.1007/s11081-005-1741-7zbMath1166.90318OpenAlexW2079003301MaRDI QIDQ833385
Walid Ben-Ameur, Hervé L. M. Kerivin
Publication date: 12 August 2009
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-005-1741-7
polynomial time algorithmnetwork designroutingtraffic uncertaintyvirtual private networkpolyhedral model
Related Items
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 ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty ⋮ Design of trees in the hose model: the balanced case ⋮ New discoveries of domination between traffic matrices ⋮ Robust delay-constrained routing in telecommunications ⋮ 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 ⋮ Robust optimal discrete arc sizing for tree-shaped potential networks ⋮ Affine routing for robust network design ⋮ On 2-stage robust LP with RHS uncertainty: complexity results and applications ⋮ Static and dynamic routing under disjoint dominant extreme demands ⋮ On total traffic domination in non-complete graphs ⋮ An approach to robust network design in telecommunications ⋮ Network design with a discrete set of traffic matrices ⋮ A comparison of routing sets for robust network design ⋮ Robust multiobjective optimization with application to Internet routing ⋮ Multipolar robust optimization ⋮ 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 ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ On the approximability of robust network design ⋮ Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Robust network design in telecommunications under polytope demand uncertainty ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Single-path routing of stochastic flows in networks ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ Unnamed Item ⋮ Robust capacity assignment solutions for telecommunications networks with uncertain demands ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study ⋮ Applications of meta-heuristics to traffic engineering in IP networks ⋮ Robust routing and optimal partitioning of a traffic demand polytope ⋮ A distributed method for optimal capacity reservation ⋮ Virtual Private Network Design Under Traffic Uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Models for planning capacity expansion in local access telecommunication networks
- The ellipsoid method and its consequences in combinatorial optimization
- Topological design of telecommunication networks --- local access design methods
- Minimum cost capacity installation for multicommodity network flows
- Optimal internal pricing and capacity planning for service facility with finite buffer
- Incentive pricing in multiclass systems
- Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On the Extreme Rays of the Metric Cone
- Disjoint paths in a network
- Dynamic facility location: The progressive p-median problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Internet Routing and Related Topology Issues
- Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
- Network Design Using Cut Inequalities
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Steiner trees and polyhedra
