A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes

Authors:
Kejun Yao;Jie Wu
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 5
Cited 7

Topological Properties of Hypercubes

IEEE Transactions on Computers
Multicast in hypercube multiprocessors

Journal of Parallel and Distributed Computing
Fault-tolerant multicasting on hypercubes

Journal of Parallel and Distributed Computing
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Multicast Communication in Multicomputer Networks

IEEE Transactions on Parallel and Distributed Systems

Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
Efficient Fault-Tolerant Multicast Scheme for Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
Fault-tolerant routing and multicasting in hypercubes using a partial path set-up

Parallel Computing
Fault-tolerant multicasting in hypercubes using local safety information

Journal of Parallel and Distributed Computing
Unicast-based fault-tolerant multicasting in wormhole-routed hypercubes

Journal of Systems Architecture: the EUROMICRO Journal
Fault-tolerant routing and multicasting in hypercubes using a partial path set-up

Parallel Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

We study the multicast problem in hypercubes with faulty nodes. We assume that each node has limited global information of fault distribution, which is captured by the safety level associated with the node. Basically, the safety level is an approximate measure of the distribution of faulty nodes in the neighborhood. We first propose a safety-level-based multicasting scheme which guarantees time optimality. We then present a variant of this scheme that reduces the number of traffic steps. Finally, an address-sum-based multicasting scheme is studied which utilizes both the distribution of destination nodes and the safety level of neighboring nodes. Simulation results show that the traffic generated in both schemes is very close to optimal. Time optimality is guaranteed when the source is safe and at most two additional time steps are required when the source is unsafe in an n-dimensional cube (denoted as n-cube) with up to n驴 1 node faults.