An algorithm for determining the best path in a computer communication network

Abstract

This paper presents an algorithm for determining the best path between two specified vertices of a computer communication network, taking into account the reliabilities and delay at nodes and of links. The network is modelled by a linear graph. The basic idea of node removal technique, which is generally used for finding Boolean-transmission functions between input-output terminals in the analysis of switching network, is extended to develop the proposed algorithm. 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 is efficient especially for large networks. The algorithm is explained with the help of a numerical example, which considers the well-known ARPA network.