Reliable broadcasting algorithm for a cube-connected cycles network

An efficient algorithm for broadcasting in a cube-connected-cycles network containing faulty nodes/links is proposed. The algorithm is particularly useful in critical real-time systems that cannot tolerate the time overhead of identifying the faulty processors online. The algorithm delivers multiple copies of the broadcast message through disjoint paths to all the nodes in the system. The salient feature of the proposed algorithm is that the delivery of the multiple copies is transparent to the processors receiving the message and does not require the processes to know the identity of the faulty processors. The processes on nonfaulty nodes that receive the message identify the original message from the multiple copies using some scheme appropriate for the fault model used. The number of steps in which the algorithm completes if it can use all or at most one of its outgoing nodes is determined