A Fault-Tolerant Adaptive and Minimal Routing Approach in n-D Meshes
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Broadcasting and routing in faulty mesh networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.01 |
We propose a sufficient condition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes. Unlike many traditional models that assume all the nodes know global fault distribution or just adjacent fault information, our approach is based on the concept of {limited global fault information}. First, we propose a fault model called {faulty cube} in which all faulty nodes in the system are contained in a set of faulty cubes. Fault information is then distributed to limited number of nodes while it is still sufficient to support minimal routing. A vector called extended safety level represents the limited fault information collected at each node. The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination. Our results show that any minimal routing that is partially adaptive can be applied in our model as long as the destination node meets a certain condition. We also propose a dynamic planar adaptive routing scheme that offers better fault tolerance and adaptivity than the planar adaptive routing scheme in 3-D meshes. {Our approach is the first attempt to address adaptive and minimal routing in 3-D meshes with faulty nodes using limited fault information.