Reliable broadcasting in product networks

Abstract We investigate the reliability of broadcasting in product networks containing faulty nodes and/or links. Faults considered in this paper are mainly of the Byzantine type, i.e., a faulty node or a faulty link may not only stop sending a message but also arbitrarily change a message passing through the faulty place or even fabricate a false message. We assume that no nodes have a priori information about faults in a network. Hence, the key problem of reliable broadcasting in our model is how to control the message transmission so that any corrupted message cannot affect the result of the broadcasting too much. We propose the concept of an n-channel graph which has n-independent spanning trees rooted at each node. The fault tolerance can be achieved by sending n copies of the message along the n-independent spanning trees rooted at the source node. In this paper we show how to construct n-independent spanning trees of a product network from spanning trees of n-component graphs. Furthermore, we can design an efficient and reliable broadcasting scheme based on independent spanning trees for a product network from simple broadcasting schemes for component networks. The degrees of fault tolerance against crash faults and Byzantine faults of nodes and/or links are, respectively, n − 1 and ⌊(n − 1)/2⌋ in the worst case. We can successfully broadcast with a probability higher than 1 − k −⌈ n 2 ⌉ in any product network of order N consisting of n-component graphs of order b or less, if at most N/4b3nk faulty nodes are randomly distributed in the network. We can also successfully broadcast with a probability higher than 1 − k −⌈ n 2 ⌉ in any product network of size L, of n component graphs of size b or less, if at most L l2b 2 k faulty links are randomly distributed in the network.

[1]  Sam Toueg,et al.  A Modular Approach to Fault-Tolerant Broadcasts and Related Problems , 1994 .

[2]  Andrzej Pelc,et al.  Reliable communication in networks with Byzantine link failures , 1992, Networks.

[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]  Pankaj Jalote,et al.  Fault tolerance in distributed systems , 1994 .

[5]  S. N. Maheshwari,et al.  Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs , 1988, J. Algorithms.

[6]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1988, Inf. Comput..

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

[8]  Andrzej Pelc,et al.  Optimal communication in networks with randomly distributed byzantine faults , 1993, Networks.

[9]  Alon Itai,et al.  Three tree-paths , 1989, J. Graph Theory.

[10]  Parameswaran Ramanathan,et al.  Reliable Broadcast in Hypercube Multicomputers , 1988, IEEE Trans. Computers.

[11]  Daniel Bienstock.  Broadcasting with random faults , 1988, Discret. Appl. Math..

[12]  Luisa Gargano,et al.  Fault - tolerant hypercube broadcasting via information dispersal , 1993, Networks.

[13]  S. Louis Hakimi,et al.  Information Dissemination in Distributed Systems With Faulty Units , 1994, IEEE Trans. Computers.

[14]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[15]  Parameswaran Ramanathan,et al.  Fault-tolerant clock synchronization in distributed systems , 1990, Computer.

[16]  Andrzej Pelc.  Fault‐tolerant broadcasting and gossiping in communication networks , 1996 .

[17]  Parameswaran Ramanathan,et al.  Hardware-Assisted Software Clock Synchronization for Homogeneous Distributed Systems , 1990, IEEE Trans. Computers.

[18]  Yoshihide Igarashi,et al.  Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults , 1994, WDAG.