The computational complexity of the reliability problem on distributed systems

DOI10.1016/S0020-0190(97)00150-6MaRDI QIDQ287259zbMATH OpenFDO

Authors Min-Sheng Lin, Deng-Jyi Chen

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitygraph theorydistributed systemsdistributed program reliability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• The disributed program reliability analysis on star topologies
• The distributed program reliability analysis on ring-type topologies
• Computational Complexity of Network Reliability Analysis: An Overview
• The Reliability Analysis of Distributed Computing Systems with Imperfect Nodes
• Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A New Algorithm for the Reliability Analysis of Multi-Terminal Networks
• Distributed program reliability analysis
• Factoring Algorithms for Computing K-Terminal Network Reliability
• Reliability Evaluation in Computer-Communication Networks
• Reliability covering problems
• Steiner problem in networks: A survey
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Enumeration and Reliability Problems
• The Complexity of Reliability Computations in Planar and Acyclic Graphs

Cited in

(12)

• The impact of overload conditions on computer network reliability
• The distributed program reliability analysis on ring-type topologies
• scientific article; zbMATH DE number 1472180 (Why is no real title available?)
• Complexity of Network Reliability and Optimal Resource Placement Problems
• The disributed program reliability analysis on star topologies
• scientific article; zbMATH DE number 139792 (Why is no real title available?)
• Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
• scientific article; zbMATH DE number 1337741 (Why is no real title available?)
• Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems.
• Computational Complexity of Network Reliability Analysis: An Overview
• Markov reliability models of fault-tolerant distributed computing systems
• A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters

This page was built for publication: The computational complexity of the reliability problem on distributed systems

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