Computing Network Reliability

DOI10.1287/OPRE.27.4.823MaRDI QIDQ4199816zbMATH OpenOpenAlexFDO

Authors Michael O. Ball

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.4.823

zbMATH Keywords

network reliabilitystochastic networkcomputation of reliability measuresfailure of nodes and links

Mathematics Subject Classification ID

Reliability and life testing (62N05) Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)

Cited in

(17)

• On computing the 2-diameter-constrained \(K\)-reliability of networks
• Integrating reliability and quality of service in networks with switched virtual circuits
• Sharing the cost of redundant items
• Low earth orbit satellite based communication systems -- research opportunities
• Design of reliable networks
• Counting almost minimum cutsets with reliability applications
• Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets
• Connectivity, stability and efficiency in a network as an information flow
• Sharing the cost of risky projects
• Finding the probability of infection in an SIR network is NP-hard
• Applying path-counting methods for measuring the robustness of the network-structured system
• Optimizing network topology for cascade resilience
• A multiple criteria model for the allocation of data files in a distributed information system
• A dynamic bounding algorithm for approximating multi-state two-terminal reliability
• An algorithm for network dimensioning under reliability considerations
• Application of Path Counting Problem and Survivability Function in Analysis of Social Systems
• Bounds on the Reliability Polynomial for Shellable Independence Systems

This page was built for publication: Computing Network Reliability

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