Analyzing Network Reliability Based on Individual Link Reliabilities Using Exhaustive Enumeration
Abstract: This project aims to explore the extent to which the reliability of the various links in a network contributes to the overall reliability of the network. The studied structure represents a complete undirected graph of five nodes (n = 5) and ten links (m = 10). Each link has a reliability, which depends on a parameter p and a unique identification number. The reliability of the network, defined as the probability of maintaining full connectivity, is computed using exhaustive enumeration. By employing the method of exhaustive enumeration, we systematically evaluate all possible combinations of link states (working or failed) to determine their impact on the network's ability to maintain connectivity. In this paper, we present an algorithm, its implementation, and experimental results that demonstrate the relationship between the reliability of the network and individual link reliabilities. Additionally, we study the impact of random computation errors on the network's reliability by flipping system conditions and observing changes.
Keywords: network reliability, undirected graph, exhaustive enumeration, link states, computation errors
How to Cite?: Krishna Mohan Pitchikala, "Analyzing Network Reliability Based on Individual Link Reliabilities Using Exhaustive Enumeration", Volume 10 Issue 6, June 2021, International Journal of Science and Research (IJSR), Pages: 1873-1877, https://www.ijsr.net/getabstract.php?paperid=SR24923132321, DOI: https://dx.doi.org/10.21275/SR24923132321