|ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
|Foundation of Computer Science USA
|QSHINE - Number 1
|Authors: Mohd Ashraf Saifi, Rajesh Mishra
Mohd Ashraf Saifi, Rajesh Mishra . An Algorithm for Enumeration of Terminal and Multi Terminal Paths in a Reliability Graph of Communication Networks. ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness. QSHINE, 1 (December 2013), 8-13.
The mathematical theory of reliability has grown out of the demand of modern technology and particularly out of the experience with complex systems. The main objective is to enhance the ability of such complex network systems. This work present an efficient algorithm, which is a novel approach to generate all the minimal paths of the general flow network based on the principle of backtracking. It is a general flow network because, the proposed approach can find the minimal paths for multiple sources and multiple sinks in the network. One can further evaluate the network reliability using any existing SDP (Sum of Disjoint Products) based approach.