Fault-tolerant multicasting on hypercubes

Albert C. Liang, Sourav Bhattacharya, Wei Tek Tsai

Research output: Contribution to journalArticle

28 Scopus citations

Abstract

Multicast (one-to-many) communication has important applications in parallel architecture and communication networks. This paper considers the multicast problem for a d dimensional binary hypercube in the presence of F link failures, where F < d. We develop a fault-tolerant (FT) multicast heuristic, namely lookahead-multicast, by including FT features into the existing fault-free hypercube multicast heuristic. The proposed FT multicast heuristic is deadlock-free and can ensure successful multicast. Reliability measures and simulation results are reported towards the performance of this approach. It is also compared with another FT multicast heuristic.

Original languageEnglish (US)
Pages (from-to)418-428
Number of pages11
JournalJournal of Parallel and Distributed Computing
Volume23
Issue number3
DOIs
StatePublished - Dec 1994

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Fault-tolerant multicasting on hypercubes'. Together they form a unique fingerprint.

  • Cite this