Title: A combinatorial study of substar reliability of the star network

Authors: Venka Palaniappan, Shahram Latifi

Addresses: Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154-4026, USA. ' Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154-4026, USA

Abstract: Hierarchical networks may be divided into subnetworks having the same topological properties of the original network. The star graph, an example of hierarchical networks, has been studied extensively as a viable candidate for massively parallel systems. For a given number of faulty links and using a combinatorial approach, lower bounds on probability of having one or more (n − 1)-stars in an n-star are determined. An identification algorithm is presented to find an available (n − 1)-star in an n-star containing a set of faulty links.

Keywords: distributed systems; link failure; reliability; star graph; subnetworks; hierarchical networks; faulty links; substar reliability; star networks.

DOI: 10.1504/IJHPSA.2008.021795

International Journal of High Performance Systems Architecture, 2008 Vol.1 No.3, pp.150 - 154

Published online: 04 Dec 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article