Performance evaluation of fault-tolerant routing on star networks

Abstract

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 subject to link failure(s). Both algorithms use the disjoint redundant paths between source and destination to bypass the faulty links. Both algorithms guarantee successful routing in an n-star if the number of link failures is leas than n-1. For higher number of link failures, we analyze their fault tolerant routing capability by Probability of Successful Routing ( P S R ) and Expected Routing Distance (ERD) and compare these results against similar fault tolerant routing algorithm on hypercube.