Optimal broadcasting in faulty hypercubes

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0 < p < 1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1 - bn-c with positive constants a,b,c depending on p, provided that p ≤ 9%, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.

Original languageEnglish (US)
Title of host publication91 Fault-Tolerant Comput. Symp.
PublisherPubl by IEEE
Pages266-273
Number of pages8
ISBN (Print)0818621508
StatePublished - Jun 1 1991
Externally publishedYes
Event21st International Symposium on Fault-Tolerant Computing - Montreal, Qui, Can
Duration: Jun 25 1991Jun 27 1991

Publication series

NameDigest of Papers - FTCS (Fault-Tolerant Computing Symposium)
ISSN (Print)0731-3071

Conference

Conference21st International Symposium on Fault-Tolerant Computing
CityMontreal, Qui, Can
Period6/25/916/27/91

Fingerprint

Broadcasting
Telecommunication links

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Chlebus, B. S., Diks, K., & Pelc, A. (1991). Optimal broadcasting in faulty hypercubes. In 91 Fault-Tolerant Comput. Symp. (pp. 266-273). (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)). Publ by IEEE.

Optimal broadcasting in faulty hypercubes. / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.

91 Fault-Tolerant Comput. Symp.. Publ by IEEE, 1991. p. 266-273 (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS, Diks, K & Pelc, A 1991, Optimal broadcasting in faulty hypercubes. in 91 Fault-Tolerant Comput. Symp.. Digest of Papers - FTCS (Fault-Tolerant Computing Symposium), Publ by IEEE, pp. 266-273, 21st International Symposium on Fault-Tolerant Computing, Montreal, Qui, Can, 6/25/91.
Chlebus BS, Diks K, Pelc A. Optimal broadcasting in faulty hypercubes. In 91 Fault-Tolerant Comput. Symp.. Publ by IEEE. 1991. p. 266-273. (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)).
Chlebus, Bogdan S. ; Diks, Krzysztof ; Pelc, Andrzej. / Optimal broadcasting in faulty hypercubes. 91 Fault-Tolerant Comput. Symp.. Publ by IEEE, 1991. pp. 266-273 (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)).
@inproceedings{b54b71252c1c4953872ee528b9216333,
title = "Optimal broadcasting in faulty hypercubes",
abstract = "The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0 < p < 1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1 - bn-c with positive constants a,b,c depending on p, provided that p ≤ 9{\%}, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.",
author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Andrzej Pelc",
year = "1991",
month = "6",
day = "1",
language = "English (US)",
isbn = "0818621508",
series = "Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)",
publisher = "Publ by IEEE",
pages = "266--273",
booktitle = "91 Fault-Tolerant Comput. Symp.",

}

TY - GEN

T1 - Optimal broadcasting in faulty hypercubes

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

PY - 1991/6/1

Y1 - 1991/6/1

N2 - The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0 < p < 1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1 - bn-c with positive constants a,b,c depending on p, provided that p ≤ 9%, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.

AB - The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0 < p < 1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1 - bn-c with positive constants a,b,c depending on p, provided that p ≤ 9%, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.

UR - http://www.scopus.com/inward/record.url?scp=0026172385&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026172385&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0026172385

SN - 0818621508

T3 - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)

SP - 266

EP - 273

BT - 91 Fault-Tolerant Comput. Symp.

PB - Publ by IEEE

ER -