On improving optimal oblivious routing

DOI10.1016/J.ORL.2009.01.009MaRDI QIDQ833579zbMATH OpenOpenAlexFDO

Authors Maria Grazia Scutellà

Publication date 14 August 2009

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2009.01.009

zbMATH Keywords

mathematical modelsoblivious routingrobust optimizationtractable cases

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Recommendations

• Optimal oblivious routing under linear and ellipsoidal uncertainty
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Survey on oblivious routing strategies

Cites work

• Designing Least-Cost Nonblocking Broadband Networks
• Hardness of robust network design

Cited in

(21)

• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Oblivious routing with limited buffer capacity
• Network design in scarce data environment using moment-based distributionally robust optimization
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• A note on hierarchical hubbing for a generalization of the VPN problem
• On the approximability of robust network design
• Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
• Oblivious network routing. Algorithms and applications
• A Time-Randomness Trade-Off for Oblivious Routing
• Survey on oblivious routing strategies
• A comparison of routing sets for robust network design
• scientific article; zbMATH DE number 7561477 (Why is no real title available?)
• Randomized Throughput-Optimal Oblivious Routing for Torus Networks
• Robust network design: formulations, valid inequalities, and computations
• Affine recourse for the robust network design problem: between static and dynamic routing
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• Optimal oblivious routing in polynomial time
• Affine routing for robust network design
• Optimal oblivious reconfigurable networks
• Static and dynamic routing under disjoint dominant extreme demands
• Moment-based distributionally robust joint chance constrained optimization for service network design under demand uncertainty

This page was built for publication: On improving optimal oblivious routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833579)