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

Title of host publication | 91 Fault-Tolerant Comput. Symp. |

Publisher | Publ by IEEE |

Pages | 266-273 |

Number of pages | 8 |

ISBN (Print) | 0818621508 |

State | Published - Jun 1 1991 |

Externally published | Yes |

Event | 21st International Symposium on Fault-Tolerant Computing - Montreal, Qui, Can Duration: Jun 25 1991 → Jun 27 1991 |

### Publication series

Name | Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) |
---|---|

ISSN (Print) | 0731-3071 |

### Conference

Conference | 21st International Symposium on Fault-Tolerant Computing |
---|---|

City | Montreal, Qui, Can |

Period | 6/25/91 → 6/27/91 |

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Optimal broadcasting in faulty hypercubes'. Together they form a unique fingerprint.

## Cite this

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