MU Digital Repository
Logo

An Optimal Data Routing Scheme for Mesh Embedded Hypercube Interconnection Network with Multiple Faulty Nodes

Kini, Gopalakrishna N and Kumar, Sathish M and Mruthyunjaya, H.S (2009) An Optimal Data Routing Scheme for Mesh Embedded Hypercube Interconnection Network with Multiple Faulty Nodes. International Journal of Computer and Information Science and Engineering, 3 (3). pp. 189-193.

[img] PDF
Paper_in_WASET.pdf - Published Version

Download (522kB)

Abstract

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 communication scheme that facilitates optimal routing in Mesh embedded hypercube interconnection networks subject to node failures in parallel 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

Item Type: Article
Uncontrolled Keywords: Embedded network, Mesh embedded hypercube network, Fault tolerance, fault list, routing
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Engineering > MIT Manipal > Electronics and Communication
Depositing User: MIT Library
Date Deposited: 27 Jun 2011 11:01
Last Modified: 27 Jun 2011 11:01
URI: http://eprints.manipal.edu/id/eprint/354

Actions (login required)

View Item View Item