Reliable broadcasting in hypercubes with random link and node failures

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Research output: Contribution to journalArticle

Abstract

We consider the problem of broadcasting in an n-node hypercube whose links and nodes fail independently with given probabilities p < 1 and q < 1, respectively. Information held in a fault-free node, called the source, has to reach all other fault-free nodes. Messages may be directly transmitted to adjacent nodes only, and every node may communicate with at most one neighbour in a unit of time. A message can be transmitted only if both communicating neighbours and the link joining them are fault-free. For parameters p and q satisfying (1 -p) (1-q) ≥ 0.99 (e.g. p = q = 0.5%), we give an algorithm working in time O (log n) and broadcasting source information to all fault-free nodes with probability exceeding 1- cn for some positive constant ε , c depending on p and q but not depending on n.

Original languageEnglish (US)
Pages (from-to)337-350
Number of pages14
JournalCombinatorics Probability and Computing
Volume5
Issue number4
DOIs
StatePublished - Jan 1 1996
Externally publishedYes

Fingerprint

Broadcasting
Hypercube
Telecommunication links
Vertex of a graph
Joining
Fault
Unit of time
Adjacent

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

Reliable broadcasting in hypercubes with random link and node failures. / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.

In: Combinatorics Probability and Computing, Vol. 5, No. 4, 01.01.1996, p. 337-350.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Diks, Krzysztof ; Pelc, Andrzej. / Reliable broadcasting in hypercubes with random link and node failures. In: Combinatorics Probability and Computing. 1996 ; Vol. 5, No. 4. pp. 337-350.
@article{8270dcaf9c04442f98f3e2f4c6eb4183,
title = "Reliable broadcasting in hypercubes with random link and node failures",
abstract = "We consider the problem of broadcasting in an n-node hypercube whose links and nodes fail independently with given probabilities p < 1 and q < 1, respectively. Information held in a fault-free node, called the source, has to reach all other fault-free nodes. Messages may be directly transmitted to adjacent nodes only, and every node may communicate with at most one neighbour in a unit of time. A message can be transmitted only if both communicating neighbours and the link joining them are fault-free. For parameters p and q satisfying (1 -p) (1-q) ≥ 0.99 (e.g. p = q = 0.5{\%}), we give an algorithm working in time O (log n) and broadcasting source information to all fault-free nodes with probability exceeding 1- cn-ε for some positive constant ε , c depending on p and q but not depending on n.",
author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Andrzej Pelc",
year = "1996",
month = "1",
day = "1",
doi = "10.1017/S0963548300002108",
language = "English (US)",
volume = "5",
pages = "337--350",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "4",

}

TY - JOUR

T1 - Reliable broadcasting in hypercubes with random link and node failures

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

PY - 1996/1/1

Y1 - 1996/1/1

N2 - We consider the problem of broadcasting in an n-node hypercube whose links and nodes fail independently with given probabilities p < 1 and q < 1, respectively. Information held in a fault-free node, called the source, has to reach all other fault-free nodes. Messages may be directly transmitted to adjacent nodes only, and every node may communicate with at most one neighbour in a unit of time. A message can be transmitted only if both communicating neighbours and the link joining them are fault-free. For parameters p and q satisfying (1 -p) (1-q) ≥ 0.99 (e.g. p = q = 0.5%), we give an algorithm working in time O (log n) and broadcasting source information to all fault-free nodes with probability exceeding 1- cn-ε for some positive constant ε , c depending on p and q but not depending on n.

AB - We consider the problem of broadcasting in an n-node hypercube whose links and nodes fail independently with given probabilities p < 1 and q < 1, respectively. Information held in a fault-free node, called the source, has to reach all other fault-free nodes. Messages may be directly transmitted to adjacent nodes only, and every node may communicate with at most one neighbour in a unit of time. A message can be transmitted only if both communicating neighbours and the link joining them are fault-free. For parameters p and q satisfying (1 -p) (1-q) ≥ 0.99 (e.g. p = q = 0.5%), we give an algorithm working in time O (log n) and broadcasting source information to all fault-free nodes with probability exceeding 1- cn-ε for some positive constant ε , c depending on p and q but not depending on n.

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

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

U2 - 10.1017/S0963548300002108

DO - 10.1017/S0963548300002108

M3 - Article

AN - SCOPUS:0030362830

VL - 5

SP - 337

EP - 350

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 4

ER -