An Optimal Data Routing Scheme for Mesh Embedded Hypercube Interconnection Network with Multiple Faulty Nodes
N. Gopalakrishna Kini, M. Sathish Kumar, H.S Mruthyunjaya · 2009
A Mesh embedded hypercube network is analyzed to arrive at fault-tolerant communication. Though there are algorithms for fault tolerant communication in mesh and hypercube networks, there exits no efficient algorithm for the same in Mesh embedded hypercube networks. This paper describes a fault-tolerant commu- nication scheme that facilitates optimal routing in Mesh embedded hypercube interconnection networks subject to node failures in par- allel computing. It is shown that by only using feasible paths routing can be substantially simplified. An efficient routing algorithm has been proposed that can route a message from a source node to the destination in presence of fault free or of single/multiple faulty nodes in Mesh embedded hypercube interconnection networks.