Abstract
Spanning trees have been used extensively in algorithms for hypercube communications and broadcasting. We present algorithms for reconnecting spanning trees and achieving communication among the nonfaulty nodes in the hypercube. The algorithms presented provide reconfiguration for the completely unbalanced spanning tree (CUST), balanced spanning tree (BST), and general spanning tree (GST) in hypercubes in the presence of single node failure. These algorithms can reconfigure around any single fault in 0(1) reconfiguration time with no dilation and will increase the congestion of a link by, at most, one. Simulation results for the algorithms under multiple faults also are presented.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
