Broadcasting with random faults
Discrete Applied Mathematics
The multi-tree approach to reliability in distributed networks
Information and Computation
Reliable Broadcast in Hypercube Multicomputers
IEEE Transactions on Computers
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Reliable broadcasting in product networks in the presence of faulty nodes
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
IEEE Transactions on Computers
Finding Independent Spanning Trees in Partial k-Trees
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
The reliability of broadcasting in product networks is discussed. We assume that a network may contain faulty nodes and/or links of Byzantine type and that no nodes know any information about faults in advance. If there are n independent spanning trees rooted at the some node of a network, the network is called an n-channel graph. We first show a construction of n independent spanning trees rooted at the same node of a product network consisting of n component graphs. Then we design a broadcasting scheme in the product network so that messages are sent along the n independent spanning trees. This broadcasting scheme can tolerate up to [(n-1)/2] faults of Byzantine type even in the worst case. Broadcasting by the scheme is successful with a probability higher than 1-k/sup -[n/2]/ in any product network of order N consisting of n component graphs of order b or less if at most N/4b/sup 3/nk faulty nodes are randomly distributed in the network. Furthermore we show how to construct n/sub 1/+n/sub 2/ independent spanning trees in a product network of two graphs such that the one component graph is an n/sub 1/-channel graph and the other component graph is an n/sub 2/-channel graph. These independent spanning trees can be also used as efficient and reliable message channels for broadcasting in the product network.