Fault-tolerant broadcasting and gossiping in communication networks

Networks

Volumn 28, Issue 3, 1996, Pages 143-156

  Pelc, Andrzej ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012614841     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N     Document Type: Article

References (66)

1. R. Ahlswede, L. Gargano, H. S. Haroutunian, and L. H. Khachatrian, Fault-tolerant minimum broadcast networks. Networks 27 (1996) 293-307.
2. A. Bagchi and S. L. Hakimi, Information dissemination in distributed systems with faulty units. IEEE Trans. Comp. 43 (1994) 698-710.
3. F. Bao and Y. Igarashi, Reliable broadcasting in product networks with Byzantine faults. Proceedings of the 26th Annual International Symposium on Fault-Tolerant Computing (1996) 262-271.
4. F. Bao, Y. Igarashi, and K. Katano, Broadcasting in hypercubes with randomly distributed Byzantine faults. Proceedings WDAG'95, LNCS 972, 215-229.
5. M. Barborak, M. Malek, and A. Dahbura, The consensus problem in fault-tolerant computing. ACM Comput. Surv. 25 (1993) 171-220.
6. P. Berman, K. Diks, and A. Pelc, Reliable broadcasting in logarithmic time with Byzantine link failures. J. Alg., to appear.
7. K. A. Berman and M. Hawrylycz, Telephone problems with failures. SIAM J. Alg. Disc. Methods 7 (1986) 13-17.
8. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ (1989).
9. D. Bienstock, Broadcasting with random faults. Disc. Appl. Math. 20 (1988) 1-7.
10. S. Bitan and S. Zaks, Optimal linear broadcast. J. Alg. 14 (1993) 288-315.
11. D. Blough and A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults. Networks 23 (1993) 691-701.
12. J. Bruck, On optimal broadcasting in faulty hypercubes. Disc. Appl. Math. 53 (1994) 3-13.
13. S. Carlsson, Y. Igarashi, K. Kanai, A. Lingas, K. Miura, and O. Petersson, Information disseminating schemes for fault-tolerance in hypercubes. IEICE Trans. Fund. E75 (1992) 255-260.
14. S. C. Chau, Fast and robust broadcasting in faulty hypercubes. Manuscript.
15. S. C. Chau and A. L. Liestman, Constructing fault-tolerant minimal broadcast networks, J. Comb. Inf. Sys. Sci. 10 (1986) 1-18.
16. B. S. Chlebus, K. Diks, and A. Pelc, Optimal broadcasting in faulty hypercubes. Digest of Papers, FTCS'21 (1991) 266-273.
17. B. S. Chlebus, K. Diks, and A. Pelc, Sparse networks supporting efficient reliable broadcasting. Proc. 1CALP'93, LNCS 700, 388-397.
18. B. S. Chlebus, K. Diks, and A. Pelc, Fast gossiping with short unreliable messages. Disc. Appl. Math. 53 (1994) 15-24.
19. B. S. Chlebus, K. Diks, and A. Pelc, Waking up an anonymous faulty network from a single source. Proceedings of the 27th Annual Hawaii International Conference on System Sciences 2 (Jan. 1994) 187-193.
20. B. S. Chlebus, K. Diks, and A. Pelc, Reliable broadcasting in hypercubes with random link and node failures. Combin. Prob. Comput., to appear.
21. B. S. Chlebus, K. Diks, and A. Pelc, Broadcasting in synchronous networks with dynamic faults. Networks 27 (1996) 309-318.
22. C. T. Chou and I. S. Gopal, Linear broadcast routing. J. Alg. 10 (1989) 490-517.
23. K. Diks, A. Malinowski, and A. Pelc, Reliable token dispersal with random faults. Par. Proc. Lett. 4 (1994) 417-427.
24. K. Diks, A. Malinowski, and A. Pelc, Token transfer in a faulty network. Theor. Inf. Appl. 29 (1995) 383-400.
25. K. Diks and A. Pelc, Reliable gossip schemes with random link failures. Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing. (Oct. 1990) 978-987.
26. K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks. SIAM J. Disc. Math. 5 (1992) 338-344.
27. K. Diks and A. Pelc, Fault-tolerant linear broadcasting. Proceedings of the First Canada-France Conference on Parallel and Distributed Computing, Theory and Practice, Montreal, Canada, LNCS 805 (May 1994) 207-217.
28. K. Diks and A. Pelc, Efficient gossiping by packets in networks with random faults. SIAM J. Disc. Math. 9 (1996) 7-18.
29. A. Farley, Reliable minimum-time broadcast networks. Proceedings of the 18th SE Conference on Combinatorics, Graph Theory and Computing. Congress, Numer. 59 (1987) 37-48.
30. U. Feige, D. Peleg, P. Raghavan, and E. Upfal, Randomized broadcast in networks. Random Struct. Alg. 1 (1990) 447-460.
31. G. Fox, M. Johnsson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors. Prentice-Hall, Englewood Cliffs, NJ, I (1988).
32. P. Fraigniaud, Asymptotically optimal broadcasting and gossiping in faulty hypercube multicomputers. IEEE Trans. Comp. 41 (1992) 1410-1419.
33. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks. Disc. Appl. Math. 53 (1994) 79-133.
34. P. Fraigniaud, A. L. Liestman, and D. Sotteau, Eds., Open problems. Par. Proc. Lett. 3 (1993) 507-524.
35. P. Fraigniaud and C. Peyrat, Broadcasting in a hypercube when some calls fail. Inf. Proc. Lett. 39 (1991) 115-119.
36. A. Frieze and M. Molloy, Broadcasting in random graphs. Disc. Appl. Math. 54 (1994) 77-80.
37. L. Gargano, Tighter bounds on fault-tolerant broadcasting and gossiping. Networks 22 (1992) 469-486.
38. L. Gargano, A. L. Liestman, J. Peters, and D. Richards, Reliable broadcasting. Discr. Appl. Math 53 (1994) 135-148.
39. L. Gargano and A. A. Rescigno, Communication complexity of fault-tolerant information diffusion. Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Computing (1993).
40. L. Gargano, A. A. Rescigno, and U. Vaccaro, Fault-tolerant hypercube broadcasting via information dispersal. Networks 23 (1993) 271-282.
41. L. Gargano, A. A. Rescigno, and U. Vaccaro, Minimum time broadcast in faulty star networks. Manuscript.
42. L. Gargano and U. Vaccaro, Minimum time networks tolerating a logarithmic number of faults. SIAM J. Disc. Math. 5 (1992) 178-198.
43. L. Ga̧sieniec and A. Pelc, Broadcasting with a bounded fraction of faulty nodes. Technical Report RR 95/01-1, Université du Québec à Hull (1995).
44. L. Ga̧sieniec and A. Pelc, Broadcasting with linearly bounded transmission faults. Technical Report RR 95/04-7, Université du Québec à Hull (1995).
45. L. Ga̧sieniec and A. Pelc, Adaptive broadcasting with faulty nodes. Par. Comput., to appear.
46. A. V. Gerbessiotis, Broadcasting in random graphs. Discr. Appl Math. 53 (1994) 149-170.
47. A. V. Gerbessiotis, Close-to-optimal and near-optimal broadcasting in random graphs. Disc. Appl. Math. 63 (1995) 129-150.
48. R. W. Haddad, S. Roy, and A. A. Schäffer, On gossiping with faulty telephone lines. SIAM J. Alg. Disc. Methods 8 (1987) 439-445.
49. Y. Han, Y. Igarashi, K. Kanai, and K. Miura, Broadcasting in faulty binary jumping networks. J. Par. Dist. Comput. 23 (1994) 462-467.
50. S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks. Networks 18 (1988) 319-349.
51. J. Hromkovič, R. Klasing, B. Monien, and R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping). Combinatorial Network Theory. (F. Hsu and D.-Z. Du, Eds.). Science Press & AMS, to appear.
52. Y. Igarashi, K. Kanai, K. Miura, and S. Osawa, Optimal schemes for disseminating information and their fault-tolerance. IEICE Trans. Inf. Syst. E75 (1992) 22-29.
53. S. L. Johnsson and C. T. Ho, Matrix multiplication on Boolean cubes using generic communication primitives. Parallel Processing and Medium-Scale Multiprocessors (A. Wouk, Ed.). SIAM (1989) 108-156.
54. L. H. Khachatrian and H. S. Harutounian, On optimal broadcast graphs. Proceedings of the Fourth International Colloquium on Coding Theory, Armenia (1990) 69-77.
55. L. Kučera, Broadcasting through a noisy one-dimensional network. Technical Report MPI-I-93-106, Max-Planck-Institut für Informatik (1993).
56. A. L. Liestman, Fault-tolerant broadcast graphs. Networks 15 (1985) 159-171.
57. G. Maddaluno, Algorithms for the construction of fault-tolerant networks (in Italian). Thesis, Universita di Salerno, 1987.
58. S. Moran, Message complexity versus space complexity in fault tolerant broadcast protocols. Networks 19 (1989) 505-519.
59. S. Ohring and D. H. Hohndel, Optimal fault tolerant communication algorithms on product networks using spanning trees. Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing (1994) 188-195.
60. A. Pelc, Broadcasting in complete networks with faulty nodes using unreliable calls. Inf. Proc. Lett. 40 (1991) 169-174.
61. A. Pelc, Broadcasting time in sparse networks with faulty transmissions. Par. Proc. Lett. 2 (1992) 355-361.
62. A. Pelc, Fast fault-tolerant broadcasting and gossiping. Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, SIROCCO'95, Greece (June 1995) 159-172.
63. D. Peleg, A note on optimal time broadcast in faulty hypercubes. J. Par. Dist. Comp. 26 (1995) 132-135.
64. D. Peleg and A. A. Schäffer, Time bounds on fault-tolerant broadcasting. Networks 19 (1989) 803-822.
65. P. Ramanathan and K. G. Shin, Reliable broadcast in hypercube multicomputers. IEEE Trans. Comp. 37 (1988) 1654-1657.
66. E. R. Scheinerman and J. C. Wierman, Optimal and near-optimal broadcast in random graphs. Disc. Appl. Math. 25 (1989) 289-297.