Reliable broadcasting in product networks

• Published in: Discrete Applied Mathematics 1998-03, Vol.83 (1), p.3-20
• Main Authors: Bao, Feng, Igarashi, Yoshihide, Öhring, Sabine R.
• Format: Article
• Language: English
• Subjects: Broadcast; Byzantine faults; Channel graphs; Fault tolerance; Independent spanning trees; Product networks
• ISSN: 0166-218X; 1872-6771
• DOI: 10.1016/S0166-218X(97)00100-5

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/4 b 3 nk 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.