A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model
Issue No.10 - October (1999 vol.48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.805160
<p><b>Abstract</b>—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 <tmath>$n-2$</tmath> vertex and/or edge faults in the star graph with <tmath>$n!$</tmath> vertices and takes at most <tmath>$n+4$</tmath> more time units than an optimal nonadaptive broadcast scheme. Since it takes at least <tmath>$\lceil\log_2 (n!)\rceil = \Theta(n\log n)$</tmath> time units to complete a broadcast under the single port model, the gap between lower and upper bounds is fairly small.</p>
Broadcast, star graph, fault-tolerant, single-port half-duplex model.
Satoshi Fujita, "A Fault-Tolerant Broadcast Scheme in the Star Graph under the Single-Port, Half-Duplex Communication Model", IEEE Transactions on Computers, vol.48, no. 10, pp. 1123-1126, October 1999, doi:10.1109/12.805160