$k$ -终端可靠性系统的快速精确失效频率近似
A Fast and Accurate Failure Frequency Approximation for $k$-Terminal Reliability Systems
摘要:
本文研究大型组合$k$ -终端可靠性系统失效频率的近似问题。在这样的系统中,节点(其$k$是终端)通过经受随机故障和修复过程的部件连接。在任何时候,如果幸存的系统无法将所有k个终端连接在一起,则会发生系统故障。我们假设每个组件的运行时间和停机时间遵循统计独立的平稳随机过程,并且这些过程在组件之间是统计独立的。在这种情况下,故障频率的精确计算是计算上难以处理的(NP难)。在这项工作中,我们提出了一个算法来近似故障频率为任何给定的乘法误差因子,运行在多项式时间的(最小)割集的数量。此外,对于全终端可靠性系统的特殊情况,即,在所有节点都是终端的情况下,我们提出了一种算法,用于在任意乘法误差内近似故障频率,该误差在节点数(可以远小于割集的数目)的多项式时间内运行。此外,我们的模拟结果证实,所提出的方法是更快,更准确地比蒙特卡罗模拟技术近似的故障频率。
英文摘要:
This paper considers the problem of approximating the failure frequency of large-scale composite $k$-terminal reliability systems. In such systems, the nodes ($k$ of which are terminals) are connected through components which are subject to random failure and repair processes. At any time, a system failure occurs if the surviving system fails to connect all the k terminals together. We assume that each component's up-times and down-times follow statistically independent stationary random processes, and these processes are statistically independent across the components. In this setting, the exact computation of failure frequency is known to be computationally intractable (NP-hard). In this work, we present an algorithm to approximate the failure frequency for any given multiplicative error factor that runs in polynomial time in the number of (minimal) cutsets. Moreover, for the special case of all-terminal reliability systems, i.e., where all nodes are terminals, we propose an algorithm for approximating the failure frequency within an arbitrary multiplicative error that runs in polynomial time in the number of nodes (which can be much smaller than the number of cutsets). In addition, our simulation results confirm that the proposed method is much faster and more accurate than the Monte Carlo simulation technique for approximating the failure frequency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。