Reliability of hypercubes for broadcasting with random faults

IEICE Transactions on Information and Systems

Volumn E79-D, Issue 1, 1996, Pages 22-27

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

^a GUNMA UNIVERSITY   (Japan)

^b UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Broadcasting; Fault tolerance; Hypercubes; Random faults

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTER NETWORKS; ELECTRIC NETWORK ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; PROBABILITY; RANDOM PROCESSES; RELIABILITY;

HYPERCUBES; RANDOM FAULTS;

INFORMATION DISSEMINATION;

EID: 0029756309     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. M.S. Alam and R.G. Melhem, "How to use an incomplete hypercube for fault tolerance," Proc. of the 1st European Workshop on Hypercubes and Distributed Computers, pp.329-341, 1989.
2. N. Alon, A. Barak, and U. Mauber, "On disseminating information reliably without broadcasting," the 7th International Conference on Distributed Computing Systems, pp.74-81, 1987.
3. T. Altman, Y. Igarashi, and K. Obokata, "Hyper-ring connection machines," Proc. of the IEEE Region 10's Ninth -Annual International Conference on Frontiers of Computer Technology, Singapore, pp. 190-294, 1994.
4. D. Bienstock, "Broadcasting with random faults," Discrete Applied Mathematics, vol.20, pp.1-7, 1988.
5. S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura, and O. Petersson, "Information disseminating schemes for fault tolerance in hypercubes," IEICE Trans, on Fundamentals of Electronics, Communications and Computer Sciences, vol.E75-A, pp.255-260, 1992.
6. B.S. Chlebus, K. Diks, and A. Pele, "Optimal broadcasting in faulty hypercubes," Proc. of the 21st International Symposium on Fault-Tolerant Computing, pp.266-273, 1991.
7. B.S. Chlebus, K. Diks, and A. Pelc, "Sparse networks supporting efficient reliable broadcasting," Proc. of ICALP'93, LNCS, vol.710, Springer-Verlag, ppJ88-397, 1993.
8. P. Fraigniaud and C. Peyrat, "Broadcasting in a hypercube when some calls fail," Information Processing Letters, vol.39, pp.115-119, 1991.
9. L. Gargano and U. Vaccaro, "Minimum time broadcasting network tolerating a logarithmic number of faults," SI AM J. of Discrete Math., vol.5, pp.178-198, 1992.
10. L. Gargano, A. Rescigno, and U. Vaccaro, "Fault tolerant hypercubes broadcasting via information dispersal," Networks, vol.23, pp.271-282, 1993.
11. Y. Han and R. Finkel, "An optimal scheme for disseminating information," Proc. of 1988 International Conference on Parallel Processing, Chicago, Illinois, pp.198-203, 1988.
12. Y. Han, Y. Igarashi, K. Kanai, and K. Miura, "Faulttolerant broadcasting in binary jumping networks," Proc. of 3rd International Symposium, ISAAC'92, Naeoya, Japan, LNCS 650, pp. 145-154, 1992.
13. J. Hastad, T. Leighton, and M. Newman, "Fast computation using faulty hypercubes," Proc. of the 21st ACM Symposium on Theory of Computing, pp.251-263, 1989.
14. S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A survey of gossiping and broadcasting in communication networks," Networks, vol.18, pp.1249-1268, 1988.
15. Y. Igarashi, K, Kanai, K. Miura, and S. Osawa, "Optimal schemes for disseminating information and their fault tolerance," IEICE Trans. Inf. & Syst., pp.22-29, I992.
16. S. Ohring and D.H. Hohndel, "Optimal fault tolerant communication algorithm on product networks using spanning trees," Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, Oct. 1994.
17. P. Ramanathan and K.G. Shin, "Reliable broadcasting in hypercube multiprocessors," IEEE Trans, on Computers, vol.37, pp.1654-1657, 1988.