Fault-tolerant routing on the star graph with safety vectors

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.

show abstract

Fault-tolerant routing on the star graph with safety vectors

Abstract: Abstract

Cited by 5 publications

References 17 publications

Optimal broadcasting on incomplete star graph interconnection networks

Optimal broadcasting on incomplete star graph interconnection networks

Fault-Tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph

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

Contact Info

Product

Resources

About