Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
From MaRDI portal
Publication:4648697
DOI10.1002/net.21461zbMath1251.90076OpenAlexW2033982654MaRDI QIDQ4648697
Bernard Fortz, Hakan Ümit, Ayşegül Altın
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
Related Items (4)
Telecommunications network design: Technology impacts and future directions ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
Uses Software
Cites Work
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
- Increasing internet capacity using local search
- Routing of uncertain traffic demands
- On the extremal structure of an OSPF related cone
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- Edge-based traffic engineering for OSPF networks
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
- Provisioning virtual private networks under traffic uncertainty
- Valid cycles: A source of infeasibility in open shortest path first routing
- Designing Least-Cost Nonblocking Broadband Networks
- Internet Routing and Related Topology Issues
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
- Multi-hour design of survivable classical IP networks
- Routing and Capacity Optimization for IP Networks
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Intra-domain traffic engineering with shortest path routing protocols
This page was built for publication: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
