### 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 language | English (US) |
---|---|

Pages (from-to) | 337-350 |

Number of pages | 14 |

Journal | Combinatorics Probability and Computing |

Volume | 5 |

Issue number | 4 |

DOIs | |

State | Published - Jan 1 1996 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*Combinatorics Probability and Computing*,

*5*(4), 337-350. https://doi.org/10.1017/S0963548300002108

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

Research output: Contribution to journal › Article

*Combinatorics Probability and Computing*, vol. 5, no. 4, pp. 337-350. https://doi.org/10.1017/S0963548300002108

}

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 -