Issue No.02 - February (1996 vol.45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.485375
<p><b>Abstract</b>—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 <it>i</it> wildcard dimensions is derived for the star and bubble-sort networks. Interestingly, the optimally augmented star network coincides with the Transposition network, <it>T</it><sub><it>n</it></sub>. Transposition networks are studied rigorously. These networks are shown to be optimally fault-tolerant. <it>T</it><sub><it>n</it></sub> is also shown to possess wide containers with short length. Fault-diameter of <it>T</it><sub><it>n</it></sub> is shown to be <it>n</it>. While the <it>T</it><sub><it>n</it></sub> can efficiently embed star and bubble-sort graphs, it can also lend itself to an efficient embedding of meshes and hypercubes.</p>
Bubble-sort graph, Cayley graph, embedding, fault diameter, fault tolerance, generator, permutation, star graph, transposition.
Shahram Latifi, Pradip K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks", IEEE Transactions on Computers, vol.45, no. 2, pp. 230-238, February 1996, doi:10.1109/12.485375