Performance evaluation of fault-tolerant routing on star networks

The star graph has been proposed as an attractive alternative to the hypercube, offering a lower degree, a smaller diameter, and a smaller distance for a similar number of nodes. In this paper, we describe two fault-tolerant routing algorithms for star networks that are subject to link failures. Both algorithms use disjoint redundant paths between source and destination to bypass the faulty links. Both algorithms guarantee successful routing in an n-star network if the number of link failures is less than n-1. For a higher number of link failures, we analyze their fault-tolerant routing capability by the probability of successful routing (PSR) and the expected routing distance (ERD) and compare these results against a similar fault-tolerant routing algorithm on a hypercube