摘要
Reliability is an important tool for evaluating the performance of modern networks. Currently, it is NP-hard and null to calculate the exact reliability of a binary-state network when the reliability of each component is assumed to be fixed. However, this assumption is unrealistic because the reliability of each component always varies with time. To meet this practical requirement, we propose a new algorithm called the binary-addition-tree algorithm and Monte Carlo simulation based Long Short-Term Memory (LSTM-BAT-MCS), based on long short-term memory (LSTM), the Monte Carlo simulation (MCS), and the binary-addition-tree algorithm (BAT). The superiority of the proposed LSTM-BAT-MCS was demonstrated by experimental results of three benchmark networks with at most 10 −4 mean square error.