Fault tolerant unicast routing algorithm based on parallel branching method for faulty hypercube

In this study, a unicast routing algorithm based on the parallel branching method has been developed for a faulty hypercube parallel processing system. The developed method has been compared with the cube algebra method developed by us and with studies in the literature related to this subject. With the developed routing algorithm, the routing from the source node to the destination node is fulfilled in the available minimal step without any restriction on the number of faulty nodes. In the algorithm, the system with circuit switching has been considered, and the obtained results have been visually simulated by using the developed hypercube routing simulation program. The performance of the simulator has been evaluated by using a comparison of the number of fulfilled processes versus the number of faulty nodes for the two methods developed by us