Abstract

Due to the importance of the signature vector in studying the reliability of networks, some methods have been proposed by researchers to obtain the signature. The notion of signature is used when at most one link may fail at each time instant. It is more realistic to consider the case where none of the components, one component, or more than one component of the network may be destroyed at each time. Motivated by this, the concept of t-signature has been recently defined to get the reliability of such a network. The t-signature is a probability vector and depends only on the network structure. In this article, we propose an algorithm to compute the t-signature. The performance of the proposed algorithm is evaluated for some networks.

摘要

由于签名向量在研究网络可靠性中的重要性，研究人员提出了一些获取签名的方法。当最多一个链接可能在每个时刻发生故障时，使用签名的概念。更现实的是，考虑网络的任何组件、一个组件或多于一个组件可能每次都被破坏的情况。受此启发，最近定义了 t 签名的概念以获得这种网络的可靠性。t 签名是一个概率向量，仅取决于网络结构。在本文中，我们提出了一种计算 t 签名的算法。针对某些网络评估了所提出算法的性能。