Survivable IP network design with OSPF routing
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- Biased random-key genetic algorithms with applications in telecommunications
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
- scientific article; zbMATH DE number 2185951 (Why is no real title available?)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Optimization of OSPF routing in IP networks
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
- Multi-hour design of survivable classical IP networks
- Near-optimal disjoint-path facility location through set cover by pairs
- An IP network resilient routing layers building algorithm based on partheno-genetic algorithm
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Biased random-key genetic algorithms: a review
- Two-level evolutionary approach to the survivable mesh-based transport network topological design
- Better alternatives to OSPF routing
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
This page was built for publication: Survivable IP network design with OSPF routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418122)