An algorithm for network dimensioning under reliability considerations

DOI10.1007/BF02094333zbMath0825.90377OpenAlexW2082296956MaRDI QIDQ1197791

Michel Gendreau, François Soumis, Brunilde Sansó

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02094333

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Reliability, availability, maintenance, inspection in operations research (90B25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Integrating reliability and quality of service in networks with switched virtual circuits, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, Separable convexification and DCA techniques for capacity and flow assignment problems, Price-directive decomposition applied to routing in telecommunication networks

Cites Work

• On the continued Erlang loss function
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network
• Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks
• Computing Network Reliability
• Some Properties of the Erlang Loss Function
• Exact calculation of computer network reliability
• The flow deviation method: An approach to store‐and‐forward communication network design