A combinatorial study of substar reliability of the star network

Authors:
Venka Palaniappan;Shahram Latifi
Affiliations:
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
Venue:
International Journal of High Performance Systems Architecture
Year:
2008

Citing 6
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On the fault-diameter of the star graph

Information Processing Letters
Embedding an Arbitrary Binary Tree into the Star Graph

IEEE Transactions on Computers
A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model

IEEE Transactions on Computers
Hyper hamiltonian laceability on edge fault star graph

Information Sciences: an International Journal
On Some Combinatorial Properties of the Star Graph

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks

Quantified Score

Hi-index	0.01

Visualization

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.