Abstract
Broadcasting is the task of transmitting a message originated at one processor of a communication network to all other processors in the network. A minimal k-fault-tolerant broadcast network is a communication network on n vertices in which any processor can broadcast in spite of up to k line failures in optimal time Tn(k). In this paper, we study Bk(n), the minimum number of communication lines of any minimal k-fault-tolerant broadcast network on n processors. We give the value of Bk(n) for several values of n and k and, in case k < [log n], give almost-minimum k-fault-tolerant broadcast networks. © 1996 John Wiley & Sons, Inc.
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.
