The distributed program reliability analysis on ring-type topologies
From MaRDI portal
Publication:5939969
DOI10.1016/S0305-0548(99)00151-3zbMath1005.68019OpenAlexW1987655061MaRDI QIDQ5939969
Deng-Jyi Chen, Ming-Sang Chang, Kuo-Lung Ku, Min-Sheng Lin
Publication date: 23 October 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00151-3
Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
A FTA-based method for risk decision-making in emergency response ⋮ Reliability Evaluation in Grid Environment
Cites Work
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Distributed program reliability analysis
- Factoring Algorithms for Computing K-Terminal Network Reliability
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- The Complexity of Enumeration and Reliability Problems
- Reliability covering problems
This page was built for publication: The distributed program reliability analysis on ring-type topologies