Calculation of node-pair reliability in large networks with unreliable nodes
Calculation of node-pair reliability in large networks with unreliable nodes
复制标题
DOI：
10.1109/24.326428
复制
发表时间：
1994-09
影响因子：
5.9
通讯作者：
D. Torrieri
中科院分区：
文献类型：
--
作者：
D. Torrieri
提出了一种在网络可靠性计算中对不可靠节点进行补偿的新方法。该方法可以嵌入到修改的Dotson算法或任何生成具有完美节点的网络的符号可靠性表达式的算法中。它的代价随链路数线性增加，不可靠节点的影响可以直接计算。该方法取代了Aggarwal方法和其他在计算节点对可靠度时补偿不可靠节点的方法。当与修改后的Dotson算法相结合时，该方法提供了精确的可靠性估计，网络如此之大，以至于Theologou-Carlier算法无法在合理的时间内完成其计算。对于这样的网络，新的方法可以嵌入到修改后的Dotson算法来估计节点对的可靠性和在此估计的误差，即使该算法在完成之前被终止。>
A new efficient method that compensates for unreliable nodes in network reliability computations is presented. This method can be embedded in the modified Dotson algorithm or any algorithm that generates a symbolic reliability expression for networks with perfect nodes. Its cost increases linearly with the number of links, and the effect of unreliable nodes can be directly computed. This method supplants the Aggarwal method and other methods of compensating for unreliable nodes in the calculation of node-pair reliability. When combined with the modified Dotson algorithm, this method provides accurate reliability estimates for networks so large that the Theologou-Carlier algorithm cannot complete its computations in a reasonable amount of time. For such networks, the new method can be embedded in the modified Dotson algorithm to estimate both the node-pair reliability and the error in this estimate even if the algorithm is terminated before completion. >