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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Statistics - Simulation and Computation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
