Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
From MaRDI portal
Publication:4648697
DOI10.1002/NET.21461zbMATH Open1251.90076OpenAlexW2033982654MaRDI QIDQ4648697FDOQ4648697
Authors: Ayşegül Altın, Bernard Fortz, Hakan Ümit 
Publication date: 15 November 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21461
Recommendations
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- On open shortest path first related network optimisation problems
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Survivable IP network design with OSPF routing
- Optimization of OSPF routing in IP networks
Cites Work
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Provisioning virtual private networks under traffic uncertainty
- Designing Least-Cost Nonblocking Broadband Networks
- Routing of uncertain traffic demands
- Increasing internet capacity using local search
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Edge-based traffic engineering for OSPF networks
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Routing and capacity optimization for IP networks
- Valid cycles: A source of infeasibility in open shortest path first routing
- Internet Routing and Related Topology Issues
- Multi-hour design of survivable classical IP networks
- 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
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
Cited In (6)
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
- Telecommunications network design: Technology impacts and future directions
- Intra-domain traffic engineering with shortest path routing protocols
- Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Uses Software
This page was built for publication: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648697)
