In this paper, a fault tolerant routing algorithm for the newly introduced MIN Shuffle-Exchange network is introduced. For more comprehension the MIN Shuffle-Exchange average message latency and power consumption are compared with same feature in MESH and conventional Shuffle-Exchange networks with the same simulation rules and the different traffic patterns and different numbers of faulty links. As a result, the simulation has shown the lower message latency for the MIN Shuffle-Exchange in comparison with two other networks. The power consumption has slightly increased because of the MIN inherent characteristics and wiring length but, it is negligible in comparison with the increment in system performance.