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 nl vertices and takes at most n+4 more time units than an optimal nonadaptive broadcast scheme. Since it takes at least [log/sub 2/(nl)]=/spl 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
