Fault-Tolerant Broadcasting in Toroidal Networks

A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a fault-free k-ary n-cube, the proposed algorithm requires at most 3 extra communication steps in the case of cut through packet routing and n + 1 extra steps in the case of store-and-forward routing. Conditions under which this algorithm works correctly in a general toroidal network are given.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Bader Almohammad, Bella Bose
• Keywords: Algorithm, Distributed And Parallel Computing, Fault-tolerant Broadcasting Algorithm, IPPS 1998, Optimal Algorithm