Reliable broadcasting in product networks

Discrete Applied Mathematics

Volumn 83, Issue 1-3, 1998, Pages 3-20

  Bao, Feng ^a   Igarashi, Yoshihide ^a   Öhring, Sabine R ^b  

^a GUNMA UNIVERSITY   (Japan)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Broadcast; Byzantine faults; Channel graphs; Fault tolerance; Independent spanning trees; Product networks

Indexed keywords

EID: 0038485355     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00100-5     Document Type: Article

References (19)

1. A. Bagchi, L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Trans. Comput. 43 (1994) 698-710.
2. F. Bao, Y. Igarashi, K. Katano, Broadcasting in hypercubes with randomly distributed Byzantine Faults, Proc. WDAG'95, vol. 972, 1995, pp. 215-229.
3. D. Bienstock, Broadcasting with random faults, Discrete Appl. Math. 20 (1988) 1-7.
4. D.B. Blough, A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults, Networks 23 (1993) 691-701.
5. J. Cheriyan, S.N. Maheshwari, Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs, J. Algorithms 9 (1988) 507-537.
6. F. Cristian, H. Aghili, R. Strong, D. Dolev, Atomic broadcasting: from simple message diffusion to Byzantine agreement, Inform. Comput. 118 (1995) 158-179.
7. L. Gargano, A. Rescigno, U. Vaccaro, Fault-tolerant hypercube broadcasting via information dispersal, Networks 23 (1993) 271-282.
8. V. Hadzilacos, S. Toueg, A modular approach to fault-tolerant broadcasts and related problems, Technical Report, Department of Computer Science, Cornell University, 1994.
9. S.M. Hedetniemi, S.T. Hedetniemi, A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 1240-1268.
10. A. Itai, M. Rodeh, The multi-tree approach to reliability in distributed networks, Inform. Comput. 79 (1988) 43-59.
11. P. Jalote, Fault Tolerance in Distributed Systems, Prentice-Hall, Englewood Cliffs, NJ, 1994.
12. S.R. Öhring, D.H. Hohndel, Optimal fault-tolerant communication algorithms on product networks using spanning trees, 6th IEEE Symposium on Parallel and Distributed Processing, 1994.
13. A. Pelc, Reliable communication in networks with Byzantine link failures, Networks 22 (1992) 441-459.
14. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Technical Report, Department d'Informatique, Universite du Quebec, 1995.
15. P. Ramanathan, D.D. Kandlur, K.G. Shin, Hardware-assisted software clock synchronization for homogeneous distributed systems, IEEE Trans. Comput. 39 (1990) 514-524.
16. P. Ramanathan, K.G. Shin, Reliable broadcasting in hypercube multiprocessors, IEEE Trans. Comput. 37 (1988) 1654-1657.
17. P. Ramanathan, K.G. Shin, R.W. Butler, Fault-tolerant clock synchronization in distributed systems, Computer 23 (1990) 33-42.
18. A. Youssef, Cartesian product networks, Proceedings of the 1991 Internat. Conference on Parallel Processing, vol. I, 1991, pp. 684-685.
19. A. Zehavi, A. Itai, Three tree-paths, J. Graph Theory 13 (1989) 175-188.