Reliable broadcasting in product networks in the presence of faulty nodes

Product networks define a class of topologies used very often as interconnection networks for multicomputers such as meshes, tori and hypercubes. In this paper we define the maximal number of node-disjoint paths in a product network and characterize the number of shortest paths among them. The construction of a maximal number of spanning trees allows an operational broadcasting in the product network even in the presence of a maximal number (equal to the nodes's connectivity) of node failures, given that the unique paths to a given node in each spanning tree are mutually node-disjoint. Additionally, even if there are more faulty nodes than the graph's connectivity, such that theoretically the broadcasting may fail, the probability of the network to be non-operational is shown to be quite small. Compared with other reliable broadcasting algorithms, for instance in faulty hypercubes, our broadcasting scheme requires less time.

[1]  Cauligi S. Raghavendra,et al.  Total exchange in faulty SIMD hypercubes , 1994, Proceedings of 8th International Parallel Processing Symposium.

[2]  Sajal K. Das,et al.  Folded Petersen cube networks: new competitors for the hypercubes , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.

[3]  Sabine R. Öhring,et al.  Optimal fault-tolerant communication algorithms on product networks using spanning trees , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[4]  Abdou Youssef.  Cartesian Product Networks , 1991, ICPP.

[5]  Dhiraj K. Pradhan,et al.  The Hyper-deBruijn Networks: Scalable Versatile Architecture , 1993, IEEE Trans. Parallel Distributed Syst..

[6]  Sajal K. Das,et al.  The Folded Petersen Network : A New Communication-Efficient Multiprocessor Topology , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[7]  Sabine R. Öhring,et al.  Reliability of Hypercubes for Broadcasting with Random Faults , 1996 .

[8]  Sabine R. Öhring,et al.  Embeddings Into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology , 1995 .

[9]  A. K. Banerjee,et al.  Hyper Petersen network: yet another hypercube-like topology , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[10]  Arnold L. Rosenberg,et al.  Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies , 1992, Discret. Appl. Math..

[11]  Tarek A. El-Ghazawi,et al.  A unified approach to fault-tolerant routing , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[12]  Cauligi S. Raghavendra,et al.  Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes , 1993, IEEE Trans. Parallel Distributed Syst..

[13]  Krzysztof Diks,et al.  Optimal broadcasting in faulty hypercubes , 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.