An algorithm for determining the most reliable path of a network
Abstract This paper present an algorithm for determining the most reliable path between two specified vertices of a communication network, taking into account both the reliabilities of nodes and links. The proposed algorithm is based on the basic idea of node removal technique, which is generally used for finding Boolean transmission functions between input-output terminals in the analysis of bilateral switching networks. The proposed algorithm can be applied to oriented or non-oriented, symmetric or non-symmetric networks and is capable of handling networks with hundreds of nodes and links. The proposed algorithm is a good time saver and efficient for large networks, as compared to other existing methods.