OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

DOI10.1007/s11081-009-9098-yzbMath1273.90038OpenAlexW2064784845MaRDI QIDQ374694

Ayşegül Altın, Pietro Belotti, Mustafa Çelebi Pinar

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

zbMATH Keywords

branch-and-priceoblivious routingtraffic engineeringECMPOSPFtraffic uncertainty

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)

Related Items

Robust multiobjective optimization with application to Internet routing ⋮ Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty ⋮ Intra-domain traffic engineering with shortest path routing protocols

Uses Software

• MINTO

Cites Work

• Routing of uncertain traffic demands
• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Routing, merging, and sorting on parallel models of computation
• Robust solutions of uncertain linear programs
• MINTO, a Mixed INTeger Optimizer
• Robust discrete optimization and network flows
• Edge-based traffic engineering for OSPF networks
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Provisioning virtual private networks under traffic uncertainty
• Oblivious network design
• The Price of Robustness
• Optimization of Internet Protocol network design and routing
• On open shortest path first related network optimisation problems
• Domination Between Traffic Matrices
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Optimal oblivious routing in polynomial time