Feasibility and complexity of broadcasting with random transmission failures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 334-341

  Pelc, Andrzej ^a   Peleg, David ^b  

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

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Broadcasting; Byzantine faults; Omission faults; Radio networks; Random failures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBABILITY;

BYZANTINE FAULTS; OMISSION FAULTS; RADIO NETWORKS; RANDOM FAILURES;

BROADCASTING;

EID: 32344449382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073879     Document Type: Conference Paper

References (23)

1. Y. Afek, H. Attiya, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D. Wang, and L. Zuck. Reliable Communication over Unreliable Channels. J. ACM 41, (1994), 1267-1297.
2. Y. Afek, E. Gafni and A. Rosen, The slide mechanism with applications in dynamic networks, Proc. 11th ACM PODC, 1992, 35-46.
3. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, J. Computer and System Sciences 43, (1991), 290-298.
4. B. Awerbuch and S. Even, Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network, Proc. 3rd ACM PODC, 1984, 278-281.
5. B. Awerbuch, Y. Mansour and N. Shavit, Polynomial end-to-end communication, Proc 33rd IEEE FOCS, 1992, 358-363.
6. A. Bagchi and S.L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Trans. Comp. 43, (1994), 698-710.
7. F. Bao, Y. Igarashi and K. Katano, Broadcasting in hypercubes with randomly distributed Byzantine faults, Proc. WDAG'95, LNCS 972, 215-229.
8. R. Bar-Yehuda, O. Goldreich and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, J. Computer and System Sciences 45, (1992), 104-126.
9. P. Berman, K. Diks and A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures, J. of Algorithms 22, (1997), 199-211.
10. D. Blough and A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults. Networks 23, (1993), 691-701.
11. A. Czumaj and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, Proc 44th IEEE FOCS, 2003, 492-501.
12. K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. on Discrete Mathematics 5, (1992), 338-344.
13. D. Dolev, The Byzantine generals strike again, J. of Algorithms 3, (1982), 14-30.
14. A. D. Fekete, N. Lynch, Y. Mansour, and J. Spinelli. The impossibility of implementing reliable communication in the face of crashes. J. ACM 40, (1993), 1087-1107.
15. E. Gafni and Y. Afek, End-to-end communication in unreliable networks, Proc. 7th ACM PODC, 1988, 131-148.
16. A. Herzberg and S. Kutten, Fast isolation of arbitrary forwarding faults, Proc. 8th ACM PODC, 1989.
17. C.-Y. Koo, Broadcast in radio networks tolerating Byzantine adversarial behavior, Proc. 23rd ACM PODC, 2004.
18. D. Kowalski and A. Pelc, Time of deterministic broadcasting in radio networks with local knowledge, SIAM J. on Computing 33, (2004), 870-891.
19. E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, J. of Algorithms 39, (2001), 47-67.
20. L. Kučera, Broadcasting through a noisy one-dimensional network, Tech. Report MPI-I-93-106, Max-Planck-Institut, Saarbruecken, Germany, 1993.
21. N. Lynch, Y. Mansour, and A. Fekete. The Data Link Layer: Two Impossibility Results. Proc 7th ACM PODC, 1988, pp. 149-170.
22. O. Goldreich, A. Herzberg and Y. Mansour. Source to Destination Communication in the Presence of Faults, Proc 7th ACM PODC, 1989, 85-101.
23. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28, (1996), 143-156.