DocumentCode
3548485
Title
Optimal broadcasting in faulty hypercubes
Author
Chlebus, B.S. ; Diks, K. ; Pelc, A.
Author_Institution
Inst. Inf., Uniwersytet Warszawski, Poland
fYear
1991
fDate
25-27 June 1991
Firstpage
266
Lastpage
273
Abstract
The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0>
Keywords
computational complexity; fault tolerant computing; hypercube networks; broadcasting algorithm; expected time; faulty hypercubes; fixed probability; information broadcasting; information dissemination; link failure; neighbor; node; transmissions; Bibliographies; Broadcasting; Communication networks; Computer architecture; Computer science; Context; Councils; Hypercubes; Stochastic processes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Fault-Tolerant Computing, 1991. FTCS-21. Digest of Papers., Twenty-First International Symposium
Conference_Location
Montreal, Quebec, Canada
Print_ISBN
0-8186-2150-8
Type
conf
DOI
10.1109/FTCS.1991.146672
Filename
146672
Link To Document