๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

โœ Scribed by Carlsson, G.E.; Cruthirds, J.E.; Sexton, H.B.; Wright, C.G.

Book ID
114606884
Publisher
IEEE
Year
1985
Tongue
English
Weight
977 KB
Volume
C-34
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Construction of Fault-Tolerant Cu
On the Construction of Fault-Tolerant Cube-Connected Cycles Networks
โœ J. Bruck; R. Cypher; C.T. Ho ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 772 KB

This paper presents a new approach to tolerating edge faults and node faults in (CCC) networks of Cube-Connected Cycles in a worst-case scenario. Our constructions of fault-tolerant CCC networks are obtained by adding extra edges to the CCC. The main objective is to reduce the cost of the fault-tole

A new class of interconnection networks
A new class of interconnection networks based on the alternating group
โœ Jung-Sing Jwo; S. Lakshmivarahan; S. K. Dhall ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 724 KB

This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni