Token transfer in a faulty network
Diks, Krzysztof ; Malinowski, Adam ; Pelc, Andrzej
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995), p. 383-400 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1995-01-01
@article{ITA_1995__29_5_383_0,
     author = {Diks, Krzysztof and Malinowski, Adam and Pelc, Andrzej},
     title = {Token transfer in a faulty network},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {29},
     year = {1995},
     pages = {383-400},
     mrnumber = {1360666},
     zbl = {0838.68007},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1995__29_5_383_0}
}

Diks, Krzysztof; Malinowski, Adam; Pelc, Andrzej. Token transfer in a faulty network. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) pp. 383-400. http://gdmltest.u-ga.fr/item/ITA_1995__29_5_383_0/

1. K. A. Berman and M. Hawrylycz, Telephone problems with failures, SIAM J. Alg. Disc. Meth., 1986, 7, pp. 13-17. | MR 819701 | Zbl 0578.05059

2. D. Bienstock, Broadcasting with random faults, Disc. Appl. Math., 1988, 20, pp. 1-7. | MR 936893 | Zbl 0658.05068

3. S. Bitan and S. Zaks, Optimal linear broadcast, J. of Algorithms, 1993, 14, pp. 288-315. | MR 1201930 | Zbl 0774.68014

4. B. S. Chlebus, K. Diks and A. Pelc, Sparse networks supporting efficient reliable broadcasting, Proc. of the 20th International Colloquium on Automata, Languages and Programming, ICALP-93, LNCS 700, pp. 388-397.

5. B. S. Chlebus, K. Diks and A. Pelc, Optimal broadcasting in faulty hypercubes, Digest of Papers, FTCS-21, 1991, pp. 266-273.

6. B. S. Chlebus, K. Diks and A. Pelc, Fast gossiping with short unreliable messages, Disc. Appl. Math., to appear. | MR 1290999 | Zbl 0807.94029

7. B. S. Chlebus, K. Diks and A. Pelc, Waking up an anonymous faulty network from a single source, Proc. of the 27th Annual Hawaii International Conference on System Sciences, 1994, Vol. 2, pp. 187-193. | MR 1259015

8. C.-T. Chou and I. S. Gopal, Linear broadcast routing, J. of Algorithms, 1989, 10, pp. 490-517. | MR 1022108 | Zbl 0825.68415

9. K. Diks and A. Pelc, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math., 1992, 5, pp. 338-344. | MR 1172742 | Zbl 0768.05060

10. K. Diks and A. Pelc, Linear time gossiping with random faults, Rapport de Recherche RR 93/02-3, Université du Québec à Hull, 1993.

11. L. Gargano, Tighter time bounds on fault-tolerant broadcasting and gossiping, Networks, 1992, 22, pp. 469-486. | MR 1170949 | Zbl 0758.90033

12. R. W. Haddad, S. Roy and A. A. Schaffer, On gossiping with faulty telephone lines, SIAM J. Alg. Disc. Meth., 1987, 8, pp. 439-445. | MR 897741 | Zbl 0626.05033

13. T. Hagerup and C. Rub, A guided tour of Chernoff bounds, Inf. Proc. Letters, 1989/90, 33, pp. 305-308. | MR 1045520 | Zbl 0702.60021

14. S. M. Hedetniemi, S. T. Hedetniemi and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, 1988, 18, pp. 319-349. | MR 964236 | Zbl 0649.90047

15. E. R. Scheinerman and J. C. Wierman, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math., 1989, 25, pp. 289-297 | MR 1026338 | Zbl 0709.05031