Sciweavers

Share
IPPS
1998
IEEE

Fault-Tolerant Broadcasting in Toroidal Networks

10 years 5 months ago
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.
Bader Almohammad, Bella Bose
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Bader Almohammad, Bella Bose
Comments (0)
books