USING MINIMAL PATH ALGORITHM FOR MEASUREMENT OF NETWORK RELIABILITY
Kunjali Bhardwaj · 2014
The mathematical theory of reliability has grown out of the demand of modern technology and particularly out of the experience with complex military equipment and systems. The early Advance Research Project Agency (ARPA) network, the forerunner of today's Internet and World Wide Web, motivated this. Although, the problem of computing the probability that distinguished nodes in a network would remain connected is an NP-hard problem, the area has continued to catch the attention of researchers all over the globe to explore and develop efficient algorithms. The main objective is to enhance the ability of such complex network systems. For this research, reliability is an important consideration. Ideally, we design the network models and algorithms and take as input and produce as output of network design model. Minimal Paths and Minimal Cuts are the most popular connectivity methods and many researchers address many network design problems. This work proposes an algorithm to generate all the minimal paths of the general flow network, which is a novel approach and it is based on the principle of backtracking; we can further evaluate the network reliability using any existing SDP based approach. Index term : Principal of Backtracking, SDP base approach, flow network, Distributed communication network, multi source and multi sink communication network, path set and cut set based algorithm, Graphs connectivity and network.