Determining reliability signature by minimal cut method for complex-parallel network
Abdullah Mohammed Hassan, Zahir Al-Khafaji
Abstract
The process of counting minimal cut sets (MCS) in a network is typically more difficult than finding minimal path sets (MPS). The first aim of this work is to provide a precise and effective method for counting the (MCS) of directed networks. The second aim is to calculate the effectiveness of a complex-parallel network using the (MCM) to evaluate the reliability of a complex-parallel network. The (MCM) has been applied for predicting network reliability, minimal (MS), tails signatures (TS), signatures, and Barlow-Brochan indexes.
Topics & Concepts
Signature (topology)Reliability (semiconductor)Computer sciencePath (computing)AlgorithmAverage path lengthComplex networkMathematicsTheoretical computer scienceShortest path problemPhysicsProgramming languageQuantum mechanicsGeometryGraphPower (physics)World Wide WebInfrastructure Maintenance and MonitoringReliability and Maintenance OptimizationAsphalt Pavement Performance Evaluation