Abstract
We consider the problem of broadcasting in a network G under the hypothesis that each vertex can inform in one unit of time all of its neighbours and that any number of message transmissions, less than the edge-connectivity of G, may fail during each time unit. In particular, we study broadcasting in the n-dimensional k-ary torus, a popular topology for link connections in communication networks. We prove that under the above strong fault-assumption, if k is even and polynomially limited in n, and n is sufficient large, broadcasting in the n-dimensional k-ary torus can be accomplished in time [Formula: see text], where [Formula: see text] is the diameter of the n-dimensional k-ary torus.
Sign-in/Register to access full text options 
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.
