Multicasting in injured hypercubes using limited global information

We study the multicast problem in injured hypercubes with faulty nodes by assuming that each node in a cube has limited global information, 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. Then an address-sum based multicasting scheme is studied which utilizes both the distribution of destination nodes and safety levels of neighboring nodes. Simulation results show that the traffic generated in both schemes is very close to the optimal solution. Time optimality is guaranteed when the source is safe and an additional time step is required when the source is unsafe in an n-cube with up to n - 1 node faults