A new routing algorithm is proposed for the network architecture developed by D. K. Pradhan and S. M. Reddy (1982). It has been shown that this algorithm gives the shortest path from the source to destination when all the processors and the communication links of the network are nonfaulty. For the situation when some of the processors are faulty, a heuristic function is given which, if used in the routing algorithm, will give the shortest path from the source to destination, if such a path exists.
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics