Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures

Journal of Algorithms

Volumn 22, Issue 2, 1997, Pages 199-211

  Berman, Piotr ^a   Diks, Krzysztof ^b   Pelc, Andrzej ^c  

^a The Pennsylvania State University   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039164244     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0810     Document Type: Article

References (18)

1. S. Assaf and E. Upfal, Fault-tolerant sorting networks, SIAM J. Discrete Math. 4 (1991), 472-480.
2. K. A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Algebra Discrete Methods 7 (1986), 13-17.
3. P. Berman and A. Pelc, "Efficient Broadcasting and Gossiping with Byzantine Link Failures," Rapport de Recherche RR 92/11-11, Université du Québec à Hull, 1992.
4. D. Bienstock, Broadcasting with random faults, Discrete Appl. Math. 20 (1988), 1-7.
5. D. M. Blough and A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults, Networks 23 (1993), 691-701.
6. B. S. Chlebus, K. Diks, and A. Pelc, Sparse networks supporting efficient reliable broadcasting, in Proceedings ICALP-93, Lecture Notes in Computer Science, Vol. 700, 388-397, Springer-Verlag, Berlin/New York.
7. B. S. Chlebus, K. Diks and A. Pelc, Optimal broadcasting in faulty hypercubes, in "Digest of Papers, FTCS-21," 1991, pp. 266-273.
8. K. Diks and A. Pelc, Reliable gossip schemes with random link failures, in "Proceedings 28th Annual Allerton Conference on Communication, Control and Computation, 1990," pp. 978-987.
9. K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Discrete Math. 5 (1992), 338-344.
10. U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized broadcast in networks, Random Structures Algorithms 1 (1990), 447-460.
11. L. Gargano, Tighter time bounds on fault-tolerant broadcasting and gossiping, Networks 22 (1992), 469-486.
12. L. Gargano and U. Vaccaro, Minimum time broadcast networks tolerating a logarithmic number of faults, SIAM J. Discrete Math. 5 (1992), 178-198.
13. R. W. Haddad, S. Roy, and A. A. Schaffer, On gossiping with faulty telephone lines, SIAM J. Algebraic Discrete Methods 8 (1987), 439-445.
14. T. Hagerup and C. Rub, A guided tour of Chernoff bounds, Inform. Process. Lett. 33 (1989/1990), 305-308.
15. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319-349.
16. A. Lubotzky, R. Phillips, and P. Sarnak, Explicit expanders and the Ramanujan conjectures, in "Proceedings 18th Annual ACM Symposium on Theory of Computing, 1986," pp. 240-246.
17. A. Pelc, Reliable communication in networks with Byzantine link failures, Networks, 22 (1992), 441-459.
18. E. R. Scheinerman and J. C. Wierman, Optimal and near-optimal broadcast in random graphs, Discrete Appl. Math. 25 (1989), 289-297.