A novel optimal routing and a fault-tolerant routing for the incrementally extensible hypercube network

Authors:
Hsun-Wen Chang;Ching-Wen Yu
Affiliations:
Department of Applied Mathematics, Tatung University, Taipei, Taiwan, R.O.C.;Department of Applied Mathematics, Tatung University, Taipei, Taiwan, R.O.C.
Venue:
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Year:
2005

Citing 7
Cited 0

Incomplete Hypercubes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
Supercube: An optimally fault tolerant network architecture

Acta Informatica
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Fibonacci Cubes-A New Interconnection Topology

IEEE Transactions on Parallel and Distributed Systems
Finding Hamiltonian Cycles on Incrementally Extensible Hypercube Graphs

HPC-ASIA '97 Proceedings of the High-Performance Computing on the Information Superhighway, HPC-Asia '97
Incrementally extensible hypercube networks and their fault tolerance

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The incrementally extensible hypercube (IEH) network, a variant of the hypercube, is defined for every positive number and has been widely discussed. However, some properties of the IEH network are incorrect and have been misused. Moreover, no deterministic fault-tolerant routing has been proposed. In this paper, we first simplify the construction of an IEH network. Then we point out the mistakes in the topology of the number of edges, the diameter, and the shortest paths. We present the correct results and propose a novel optimal routing algorithm. Moreover, a deterministic fault-tolerant routing algorithm for the IEH network is proposed.