Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

DOI10.1002/NET.21461MaRDI QIDQ4648697zbMATH OpenOpenAlexFDO

Authors Ayşegül Altın, Bernard Fortz, Hakan Ümit

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

zbMATH Keywords

tabu searchoblivious routingOSPFhose modelpolyhedral demand

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Recommendations

• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• On open shortest path first related network optimisation problems
• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Survivable IP network design with OSPF routing
• Optimization of OSPF routing in IP networks

Cites work

• Applications of meta-heuristics to traffic engineering in IP networks
• Designing Least-Cost Nonblocking Broadband Networks
• Edge-based traffic engineering for OSPF networks
• Efficient techniques and tools for intra-domain traffic engineering
• Increasing internet capacity using local search
• Internet Routing and Related Topology Issues
• Intra-domain traffic engineering with shortest path routing protocols
• Multi-hour design of survivable classical IP networks
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
• On the extremal structure of an OSPF related cone
• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Provisioning virtual private networks under traffic uncertainty
• Routing and capacity optimization for IP networks
• Routing of uncertain traffic demands
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Valid cycles: A source of infeasibility in open shortest path first routing

Cited in

(7)

• Optimal oblivious routing under linear and ellipsoidal uncertainty
• Telecommunications network design: Technology impacts and future directions
• Intra-domain traffic engineering with shortest path routing protocols
• Augmenting predictive with oblivious routing for wireless mesh networks under traffic uncertainty
• A practicable robust counterpart formulation for decomposable functions: a network congestion case study
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Describes a project that uses

Uses Software

• TOTEM

This page was built for publication: Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

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