Cube-connected modules: a family of cubic networks
Resource
Parallel Architectures, Algorithms and Networks, 1994. (ISPAN) International Symposium on
Journal
International Symposium on Parallel Architectures, Algorithms and Networks
Pages
-
Date Issued
1994-12
Date
1994-12
Author(s)
DOI
N/A
Abstract
A family of cubic networks, named cube-connected modules, is proposed in this paper.The cubeconnected modules network consists of modules which are interconnected as a hypercube.Any connected graph, e.g., cycle, hypercube graph, and complete graph, can serve as a module.Topological properties are investigated, and the problams of routing, broadcasting, embedding, and finding parallel routing paths are studied.We show that the problem of determining the shortest routing path is "-hard, and it can be transformed to the asymmetric traveling salesman problem.The broadcasting algorithms on cube-connected modules can be obtained by combining broadcasting algorithms on hypercubes and broadcasting algorithms on modules.We show that if the modules are hamiltonian, then the cube-connected modules are also hamiltonian.Moreover, a sufficient condition is given for the existence of maximum number of parallel paths between any two nodes of cubeconnected modules.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00367164.pdf
Size
419.31 KB
Format
Adobe PDF
Checksum
(MD5):777375032ea2f1bfdbfcd3d8dd11ba8d