%0 Journal Article
	%A Lokendra Singh Umrao and  Ravi Shankar Singh
	%D 2015
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 98, 2015
	%T Fault-Tolerant Optimal Broadcast Algorithm for the Hypercube Topology
	%U https://publications.waset.org/pdf/10001401
	%V 98
	%X This paper presents an optimal broadcast algorithm
for the hypercube networks. The main focus of the paper is the
effectiveness of the algorithm in the presence of many node faults.
For the optimal solution, our algorithm builds with spanning tree
connecting the all nodes of the networks, through which messages
are propagated from source node to remaining nodes. At any given
time, maximum n − 1 nodes may fail due to crashing. We show
that the hypercube networks are strongly fault-tolerant. Simulation
results analyze to accomplish algorithm characteristics under many
node faults. We have compared our simulation results between our
proposed method and the Fu’s method. Fu’s approach cannot tolerate
n − 1 faulty nodes in the worst case, but our approach can tolerate
n − 1 faulty nodes.
	%P 576 - 580