A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph

Abstract

Abstract-In this paper, we focus on the design of the faulttolerant routing algorithm for the (n, k)-star graph. We apply the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph. First, we build the probabilistic safety vector (PSV) with modified cycle patterns. Then, our routing algorithm decides the fault-free routing path with the help of PSV. The performance is judged by the average length of routing paths. Compared with distance first search and safety level, we get the best performance in the simulations.

Fault-Tolerant Routing in (n, k) - Star Graphs

“…In this section, we describe the detail of the experiment and its results. For comparison, we adopted a method by Chiu et al [38]. We call the routing algorithm by them CYH.…”

“…Hence, the safety vectors on a star graph are based on routing patterns while those on a hypercube are based on distances. For an (n, k)-star graph, Chiu et al [38] have proposed an extended definition of safety vectors. In our study, we improve the definition of safety vectors for an (n, k)-star graph to attain higher reachability as well as to provide a faster calculation method for them.…”