On open shortest path first related network optimisation problems

DOI10.1016/S0166-5316(02)00036-6zbMath1044.68012OpenAlexW2110600607MaRDI QIDQ4788394

No author found.

Publication date: 21 January 2003

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-5316(02)00036-6

zbMATH Keywords

Multicommodity flowsOSPFTraffic engineeringNetwork optimisation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Efficient techniques and tools for intra-domain traffic engineering ⋮ Optimization of OSPF Routing in IP Networks

Uses Software

• Genocop

This page was built for publication: On open shortest path first related network optimisation problems