In this paper, a new unit-expansion hypercube-like system is proposed. The topology of our system (which contains 2n + k complete nodes, 0 < k < 2n) is formed by concatenating two graphs in which one is a complete n-cube graph composed of 22 complete nodes and the other is a partial n-cube graph composed of k complete nodes. The main advantage of our system is that it can increase its system size by one node at a time (called unit-expansion) and maintain a large scale of disjoint paths between any pair of complete nodes, which therefore enhances the fault-tolerant ability of the system. Other topological properties of our system are: (1) our system is more regular than the other unit-expansion hypercube-like systems; (2) all of the complete nodes in our system are logically neighboring, which decreases the communicating delays significantly; and (3) our system is recursive in nature, that is, the structure needs not to be reconfigured as the system size increases.
|Number of pages||8|
|Journal||International journal of mini & microcomputers|
|Publication status||Published - 1996 Jan 1|
All Science Journal Classification (ASJC) codes