IEICE TRANSACTIONS on Information
Optimal Schemes for Disseminating Information and Their Fault Tolerance
Summary :
We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t
- Publication
- IEICE TRANSACTIONS on Information Vol.E75-D No.1 pp.22-29
- Publication Date
- 1992/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Theoretical Foundations of Computing)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoshihide IGARASHI, Kumiko KANAI, Kinya MIURA, Shingo OSAWA, "Optimal Schemes for Disseminating Information and Their Fault Tolerance" in IEICE TRANSACTIONS on Information,
vol. E75-D, no. 1, pp. 22-29, January 1992, doi: .
Abstract: We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t
URL: https://global.ieice.org/en_transactions/information/10.1587/e75-d_1_22/_p
Copy
@ARTICLE{e75-d_1_22,
author={Yoshihide IGARASHI, Kumiko KANAI, Kinya MIURA, Shingo OSAWA, },
journal={IEICE TRANSACTIONS on Information},
title={Optimal Schemes for Disseminating Information and Their Fault Tolerance},
year={1992},
volume={E75-D},
number={1},
pages={22-29},
abstract={We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Optimal Schemes for Disseminating Information and Their Fault Tolerance
T2 - IEICE TRANSACTIONS on Information
SP - 22
EP - 29
AU - Yoshihide IGARASHI
AU - Kumiko KANAI
AU - Kinya MIURA
AU - Shingo OSAWA
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1992
AB - We describe two information disseminating schemes, t-disseminate and t-Rdisseminate in a computer network with N processors, where each processor can send a message to t-directions at each round. If no processors have failed, these schemes are time optimal. When at most t processors have failed, for t
ER -
English
