OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
DOI10.1007/S11081-009-9098-YzbMATH Open1273.90038OpenAlexW2064784845MaRDI QIDQ374694FDOQ374694
Authors: Ayşegül Altın, Pietro Belotti, Mustafa Ç. Pınar 
Publication date: 24 October 2013
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22474
Recommendations
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
- Routing of uncertain traffic demands
- On open shortest path first related network optimisation problems
- Increasing internet capacity using local search
Numerical optimization and variational techniques (65K10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)
Cites Work
- The Price of Robustness
- Robust solutions of uncertain linear programs
- Robust discrete optimization and network flows
- Branch-and-price: Column generation for solving huge integer programs
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Routing, merging, and sorting on parallel models of computation
- Provisioning virtual private networks under traffic uncertainty
- Routing of uncertain traffic demands
- Optimization of Internet Protocol network design and routing
- MINTO, a Mixed INTeger Optimizer
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Edge-based traffic engineering for OSPF networks
- Oblivious network design
- On open shortest path first related network optimisation problems
- Domination Between Traffic Matrices
- Optimal oblivious routing in polynomial time
Cited In (9)
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- On the complexity of equal shortest path routing
- Routing of uncertain traffic demands
- Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
- Robust multiobjective optimization with application to Internet routing
- On improving optimal oblivious routing
- On the extremal structure of an OSPF related cone
- Intra-domain traffic engineering with shortest path routing protocols
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Uses Software
This page was built for publication: OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q374694)
