We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks.
- Authors
Rescigno, A. A.; Vaccaro, U.
- Abstract
The surviving route graph R(G, ρ)/F for a graph G, a routing ρ and a set of failures F is a graph consisting of all non-faulty vertices of G and with an edge between two vertices if there are no failures in the routing between the two vertices. Numerous papers have studied the diameter of R(G, ρ)/F as a measure of the fault-tolerance of G and ρ, assuming that the cardinality of F is strictly smaller than the connectivity of G. In this paper we study the diameter of R(G, ρ)/F, when G is either the n-star graph or the n-dimensional hypercube and ρ is any minimal length routing, under the assumption that F is any set of failures not containing all the neighbours of any vertex and |F| is at most twice the connectivity of G minus 3.
- Publication
Parallel Processing Letters, 1998, Vol 8, Issue 2, p221
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S0129626498000237