Cart (Loading....) | Create Account
Close category search window

Transposition networks as a class of fault-tolerant robust networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Latifi, S. ; Dept. of Electr. Eng., Nevada Univ., Las Vegas, NV, USA ; Srimani, P.K.

The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. The networks under study belong to a subclass of Cayley graphs whose generators are subsets of all possible transpositions. We specifically focus on star and bubble sort networks. Our approach is to augment existing dimensions (or generators) with one or more dimensions. If the added dimension is capable of replacing any arbitrary failed dimension, it is called a wildcard dimension. It is shown that, up to isomorphism among digits used in labeling the vertices, the generators of the star graph are unique. The minimum number of extra dimensions needed to acquire i wildcard dimensions is derived for the star and bubble sort networks. Interestingly, the optimally augmented star network coincides with the Transposition network, Tn. Transposition networks are studied rigorously. These networks are shown to be optimally fault tolerant. Tn is also shown to possess wide containers with short length. Fault diameter of Tn is shown to be n. While the T can efficiently embed star and bubble sort graphs, it can also lend itself to an efficient embedding of meshes and hypercubes

Published in:

Computers, IEEE Transactions on  (Volume:45 ,  Issue: 2 )

Date of Publication:

Feb 1996

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.