An algorithm for network dimensioning under reliability considerations

DOI10.1007/BF02094333MaRDI QIDQ1197791zbMATH OpenOpenAlexFDO

Authors Brunilde Sansò, Michel Gendreau, François Soumis

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

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

Cites work

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

Cited in

(4)

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

This page was built for publication: An algorithm for network dimensioning under reliability considerations

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