By Topic

Fault-tolerant routing and disjoint paths in dual-cube: a new interconnection network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Yamin Li ; Fac. of Comput. & Inf. Sci., Hosei Univ., Tokyo, Japan ; Peng, S.

In this paper, we introduce a new interconnection network, the dual-cube, its topological properties, and the routing/broadcasting algorithms in the dual-cube. The advanced subjects such as fault-tolerant routing and constructing multiple disjoint paths in dual-cubes are also included in this paper. The binary hypercube, or r-cube, can connect 2r nodes. In contrast, a dual-cube with r links for each node, Fr, can connect 22r-1 nodes while keeps most of topological properties of hypercubes. Fault-tolerant routing and constructing multiple disjoint paths in dual-cubes can be solved elegantly using a new structure, called extended cube. We show that for any two nonfaulty nodes s and t in Fr which contains up to r-1 faulty nodes, we can find a fault-free path s to t, of length at most 3d(s,t) in O(r) optimal time, where d(s,t) is the distance between s and t. We also show that, in a fault-free Fr, r disjoint paths s to t, of length at most d(s,t)+6 can be constructed in O(r2) optimal time

Published in:

Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on

Date of Conference:

2001