Fault-tolerant adaptive and shortest routing in 2-D extended meshes using faulty-block-information

In this paper, I first discuss the adaptive minimal routing algorithm in 2D extended meshes without faulty blocks. Then, a sufficient condition for the existence of a minimal path from the source to the destination is presented. After that, I propose the shortest fault-tolerant routing algorithm with one faulty block, with the guidance of faulty block information, and I extend the algorithm with one faulty block to one with multiple faulty blocks. This is the first attempt to address routing algorithms on an extended mesh.