Issue No. 03 - March (1986 vol. 35)
S. Guha , Department of Mathematics, Jadavpur University
A new routing algorithm is proposed in this correspondence for the network architecture developed in . It has been shown that this algorithm gives the shortest path between the source to destination, when all the processors and the communication links of the network are non- faulty. For the situation when some of the processors are faulty, a heuristic function is given, which if used in the routing algorithm will give shortest path from the source to destination, if such a path exists.
provisional matching factor, Heuristic function, match, matching, matching factor
S. Guha and A. Sen, "On Fault-Tolerant Distributor Communication Architecture," in IEEE Transactions on Computers, vol. 35, no. , pp. 281-283, 1986.