Adaptive broadcasting with faulty nodes

Parallel Computing

Volumn 22, Issue 6, 1996, Pages 903-912

  Ga̧sieniec, Leszek ^a   Pelc, Andrzej ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Adaptive; Algorithms; Broadcasting; Fault tolerance

Indexed keywords

ADAPTIVE ALGORITHMS; BROADCASTING; FAULT TOLERANT COMPUTER SYSTEMS; PACKET SWITCHING;

BROADCASTING ALGORITHM; COMMUNICATING NODES; FAULTY NODES;

DATA COMMUNICATION SYSTEMS;

EID: 0030243374     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00023-3     Document Type: Article

References (16)

1. K.A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Algebraic Discrete Methods 7 (1986) 13-17.
2. D. Bienstock, Broadcasting with random faults, Discrete Appl. Math. 20 (1988) 1-7.
3. B.S. Chlebus, K. Diks and A. Pelc, Sparse networks supporting efficient reliable broadcasting, in: Proc. ICALP'93, Lecture Notes in Computer Science 700 (Springer, Berlin) 388-397.
4. B.S. Chlebus, K. Diks and A. Pelc, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS'21 (1991) 266-273.
5. B.S. Chlebus, K. Diks and A. Pelc, Waking up an anonymous faulty network from a single source, in: Proc. 27th Ann. Hawaii Internat. Conf. on System Sciences, Vol. 2 (1994) 187-193.
6. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (McGraw-Hill, New York, 1990).
7. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53, Special Issue on Broadcasting and Gossiping (1994) 79-133.
8. L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992) 469-486.
9. L. Gargano and U. Vaccaro, Minimum time networks tolerating a logarithmic number of faults, SIAM J. Discrete Math. 5 (1992) 178-198.
10. L. Ga̧sieniec and A. Pelc, Broadcasting with a bounded fraction of faulty nodes, Technical Report, Université du Québec à Hull (1995).
11. R.W. Haddad, S. Roy and A.A. Schäffer, On gossiping with faulty telephone lines, SIAM J. Algebraic Discrete Methods 8 (1987) 439-445.
12. S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 319-349.
13. A.L. Liestman, Fault-tolerant broadcast graphs, Networks 15 (1985) 159-171.
14. D. Peleg and A.A. Schäffer, Time bounds on fault-tolerant broadcasting, Networks 19 (1989) 803-822.
15. P. Ramanathan and K.G. Shin, Reliable broadcast in hypercube multicomputers, IEEE Trans. Comput. 37 (1988) 1654-1657.
16. E.R. Scheinerman and J.C. Wierman, Optimal and near-optimal broadcast in random graphs, Discrete Appl. Math. 25 (1989) 289-297.