Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Online multi-path routing in a maze
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
In this paper, several enhanced sufficient conditions are given for minimal routing in 2-dimensional (2-D) meshes with faulty nodes contained in a set of disjoint faulty blocks. It is based on an early work of Wu's minimal routing in 2-D meshes. Fault information is coded in a 4-tuple called extended safety level associated with each node to determine the feasibility of minimal routing. Specifically, we study the existence of minimal route at a given source nodebased on the associated extended safety level, limited distribution of faulty block information, and minimal routing. An analytical model for the number of rows and columns that receive faulty block information is also given. Extensions to Wang's minimal-connected-components (MCCs) fault model are also considered. Simulation results show substantial improvement in terms of higher percentage of minimal routing in 2-D meshes under both fault models.