FAULT-TOLERANT ALGORITHMS FOR BROADCASTING ON THE STAR GRAPH NETWORK

Fault tolerant algorithms are presented for broadcasting on the star g raph. In our algorithm, fault tolerance is achieved by constructing an isomorphism of the star network, such that the faulty nodes minimally disrupt the message passing sequence. It is shown that, in the presen ce of r(1 less than or equal to r less than or equal to k-2) faults, a t most r extra steps are required by our algorithm to perform a one-to -all broadcasting in the k-star network. Our algorithm has the same ti me complexity as an optimal broadcasting algorithm, and, since it take s advantage of the hierarchical nature of the star graph network, it c an be implemented easily. Our algorithm can also be used to perform al l-to-all broadcasting in a faulty star graph.