OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

DOI10.1007/S11081-009-9098-YMaRDI QIDQ374694zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

branch-and-pricetraffic engineeringECMPoblivious routingOSPFtraffic uncertainty

Mathematics Subject Classification ID

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

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

Cites work

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

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

Describes a project that uses

Uses Software

• MINTO

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)