A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes

This publication has 21 references indexed in Scilit:

• A Simple Method to Verify All d -Minimal Path Candidates of a Limited-Flow Network and its Reliability
  The International Journal of Advanced Manufacturing Technology, 2002
• A simple algorithm to search for all d-MPs with unreliable nodes
  Reliability Engineering & System Safety, 2001
• A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network
  IEEE Transactions on Reliability, 1998
• Reliability evaluation for distributed computing networks with imperfect nodes
  IEEE Transactions on Reliability, 1997
• An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network
  Microelectronics Reliability, 1987
• Availability evaluation of oil/gas production and transportation systems
  Reliability Engineering, 1987
• Reliability Evaluation of Multistate Systems with Multistate Components
  IEEE Transactions on Reliability, 1985
• Reliability Bounds for Multistate Systems with Multistate Components
  Operations Research, 1985
• Reliability Evaluation of a Flow Network
  IEEE Transactions on Reliability, 1980
• A Simple Method for Reliability Evaluation of a Communication System
  IEEE Transactions on Communications, 1975