A limited-global information model for fault-tolerant routing in dual-cubes

In this paper, we focus on the minimal path fault-tolerant routing without adding any extra link. First, a depth-first search routing is provided. Unlike the routing by Y. Li and S. Peng (2001), it can handle more faulty components, even when the network is disconnected. And then, it is extended by using our limited global information model. We use limited-safety-level and limited-safety-vector to represent our limited global information in dual-cubes. In a given dual-cube, the limited-safety-level (or the limited-safety-vector) of each node a is its safety level (or safety vector) of the local cluster (an r-cube). Each cluster cube maintains its own safety level and safety vector information just like in a regular cube. Adjacent clusters exchange their safety information through the cross-edge to approximate their global safety information for the routing process. Faulty nodes and faulty links are both considered in this paper. In each local cluster cube, the minimal path routing is guaranteed based on our limited global information. We propose the whole routing process by using segments of minimal routing paths. Compared with the depth-first search routing based on neighbor information, the routing based on limited global information needs fewer extra steps by using several rounds of neighbor information exchanges for each new fault configuration. The simulation results show that the limited global information model can help our routing process to generate a minimal path or a sub-minimal path (a path with only two extra steps).