On open shortest path first related network optimisation problems

DOI10.1016/S0166-5316(02)00036-6MaRDI QIDQ4788394zbMATH OpenOpenAlexFDO

Authors

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

OSPFTraffic engineeringMulticommodity flowsNetwork optimisation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Increasing internet capacity using local search
• Optimization of OSPF routing in IP networks
• A genetic algorithm for the weight setting problem in OSPF routing
• Better alternatives to OSPF routing
• Computational Science – ICCS 2005

Cited in

(27)

• A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
• Survivable IP network design with OSPF routing
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• scientific article; zbMATH DE number 1950494 (Why is no real title available?)
• An Integer Programming Algorithm for Routing Optimization in IP Networks
• Enhanced-robustness Dijkstra algorithm for control of routing in the IP-networks
• scientific article; zbMATH DE number 2185951 (Why is no real title available?)
• Efficient techniques and tools for intra-domain traffic engineering
• Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
• Two-stage algorithm for bi-objective black-box traffic engineering
• On the complexity of equal shortest path routing
• A link weight assignment algorithm for traffic-engineered networks
• Edge-based traffic engineering for OSPF networks
• Optimally routing data in fiber-optic networks with existing flow
• Design of mixed MPLS/OSPF routing in IP networks
• Optimization of OSPF routing in IP networks
• Constrained rerouting in networks: an integer programming formulation
• A genetic algorithm for the weight setting problem in OSPF routing
• scientific article; zbMATH DE number 1505488 (Why is no real title available?)
• Increasing internet capacity using local search
• scientific article; zbMATH DE number 1728521 (Why is no real title available?)
• Valid cycles: A source of infeasibility in open shortest path first routing
• Computational Science – ICCS 2005
• OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty
• Compatible weights and valid cycles in non-spanning OSPF routing patterns
• Better alternatives to OSPF routing
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Describes a project that uses

Uses Software

• Genocop

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

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