Survivable IP network design with OSPF routing
From MaRDI portal
Publication:3418122
DOI10.1002/net.20141zbMath1131.90319OpenAlexW4247995644MaRDI QIDQ3418122
Luciana S. Buriol, Mikkel Thorup, Mauricio G. C. Resende
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20141
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (8)
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks ⋮ Mathematical programming approaches for dual multicast routing problem with multilayer risk cost ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Two-level evolutionary approach to the survivable mesh-based transport network topological design
Cites Work
This page was built for publication: Survivable IP network design with OSPF routing