This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Fault-Tolerant Distributor Communication Architecture
March 1986 (vol. 35 no. 3)
pp. 281-283
S. Guha, Department of Mathematics, Jadavpur University
A new routing algorithm is proposed in this correspondence for the network architecture developed in [1]. 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.
Index Terms:
provisional matching factor, Heuristic function, match, matching, matching factor
Citation:
S. Guha, A. Sen, "On Fault-Tolerant Distributor Communication Architecture," IEEE Transactions on Computers, vol. 35, no. 3, pp. 281-283, March 1986, doi:10.1109/TC.1986.1676752
Usage of this product signifies your acceptance of the Terms of Use.