Optimal oblivious routing under linear and ellipsoidal uncertainty

DOI10.1007/S11081-007-9033-ZzbMath1175.90088OpenAlexW2023332272MaRDI QIDQ1039914

Pietro Belotti, Mustafa Çelebi Pinar

Publication date: 23 November 2009

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/23024

zbMATH Keywords

linear programmingoblivious routingsecond order cone programmingtraffic engineering

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Linear programming (90C05) Traffic problems in operations research (90B20)

Related Items (7)

OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ 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 ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Applications of meta-heuristics to traffic engineering in IP networks

Uses Software

• AMPL
• CPLEX
• Mosek

Cites Work

• Unnamed Item
• A Modeling Language for Mathematical Programming
• Robust solutions of uncertain linear programs
• A genetic algorithm for the weight setting problem in OSPF routing
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Bayesian Inference on Network Traffic Using Link Count Data
• Optimal oblivious routing in polynomial time

This page was built for publication: Optimal oblivious routing under linear and ellipsoidal uncertainty