Token transfer in a faulty network
Krzysztof Diks; Adam Malinowski; Andrzej Pelc
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)
- Volume: 29, Issue: 5, page 383-400
- ISSN: 0988-3754
Access Full Article
top
How to cite
topDiks, Krzysztof, Malinowski, Adam, and Pelc, Andrzej. "Token transfer in a faulty network." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.5 (1995): 383-400. <http://eudml.org/doc/92514>.
@article{Diks1995,
author = {Diks, Krzysztof, Malinowski, Adam, Pelc, Andrzej},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {token transfer algorithms},
language = {eng},
number = {5},
pages = {383-400},
publisher = {EDP-Sciences},
title = {Token transfer in a faulty network},
url = {http://eudml.org/doc/92514},
volume = {29},
year = {1995},
}
TY - JOUR
AU - Diks, Krzysztof
AU - Malinowski, Adam
AU - Pelc, Andrzej
TI - Token transfer in a faulty network
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 5
SP - 383
EP - 400
LA - eng
KW - token transfer algorithms
UR - http://eudml.org/doc/92514
ER -
References
top- 1. K. A. BERMAN and M. HAWRYLYCZ, Telephone problems with failures, SIAM J. Alg. Disc. Meth., 1986, 7, pp. 13-17. Zbl0578.05059MR819701
- 2. D. BIENSTOCK, Broadcasting with random faults, Disc. Appl. Math., 1988, 20, pp. 1-7. Zbl0658.05068MR936893
- 3. S. BITAN and S. ZAKS, Optimal linear broadcast, J. of Algorithms, 1993, 14, pp. 288-315. Zbl0774.68014MR1201930
- 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. Zbl0817.68019
- 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. Zbl0807.94029MR1290999
- 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. MR1259015
- 8. C.-T. CHOU and I. S. GOPAL, Linear broadcast routing, J. of Algorithms, 1989, 10, pp. 490-517. Zbl0825.68415MR1022108
- 9. K. DIKS and A. PELC, Almost safe gossiping in bounded degree networks, SIAM J. Disc. Math., 1992, 5, pp. 338-344. Zbl0768.05060MR1172742
- 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. Zbl0803.68004
- 11. L. GARGANO, Tighter time bounds on fault-tolerant broadcasting and gossiping, Networks, 1992, 22, pp. 469-486. Zbl0758.90033MR1170949
- 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. Zbl0626.05033MR897741
- 13. T. HAGERUP and C. RUB, A guided tour of Chernoff bounds, Inf. Proc. Letters, 1989/90, 33, pp. 305-308. Zbl0702.60021MR1045520
- 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. Zbl0649.90047MR964236
- 15. E. R. SCHEINERMAN and J. C. WIERMAN, Optimal and near-optimal broadcast in random graphs, Disc. Appl. Math., 1989, 25, pp. 289-297 Zbl0709.05031MR1026338
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.