Wildcard Dimensions in Augmented Star and Bubble-Sort Networks

Authors:
Shahram Latifi;Pradip K. Srimani
Affiliations:
-;-
Venue:
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
1995

Citing 5
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the fault-diameter of the star graph

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Generalized Fault Tolerance Properties of Star Graphs

ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information

Quantified Score

Hi-index	0.03

Visualization

Abstract

The paper proposes network designs which are tolerant of link failures. The networks under study belong to a subclass of Cayley graphs whose generators are transpositions. Specifically, the focus is on the star and bubble-sort networks; although the same approach can be applied to other networks constructed based on transpositions. The approach is to add links oriented in a certain direction(s) so that the original links along that particular direction(s) can be replaced by spare links in case of failure.