A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model

  • Authors:

  • Satoshi Fujita

  • Affiliations:

  • Hiroshima Univ., Higashi-Hiroshima, Japan

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1999

Quantified Score

Hi-index 14.98

Visualization

Abstract

In this paper, we propose a simple and nonadaptive fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model. The proposed scheme can tolerate up to $n-2$ vertex and/or edge faults in the star graph with $n!$ vertices and takes at most $n+4$ more time units than an optimal nonadaptive broadcast scheme. Since it takes at least $\lceil\log_2 (n!)\rceil = \Theta(n\log n)$ time units to complete a broadcast under the single port model, the gap between lower and upper bounds is fairly small.