Fault-Tolerant Routing based on Improved Safety Levels in Pancake Graphs

In a parallel processing system, a pancake graph is one of the superior topologies for interconnection network because of the small diameter and the high degree. In previous research, fault-tolerant routing using restricted global information called safety levels in a pancake graph was proposed. But there are some rooms for improvement. Therefore, we propose a fault-tolerant routing algorithm based on improved safety levels to attain higher reachability. In addition, we estimated the proposed method in time and space complexities, and carried out a computer experiment to verify its effectiveness.