Skip to Main content Skip to Navigation
Journal articles

Broascasting in de Bruijn networks

Abstract : Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of a network. To broadcast time of a vertex is the minimim number ot time units required to complete broadcasting from this vertex. Several previous papers have investigated methods to construct sparse networks in which this process can be completed in minimim time from any originator. But the graphs produced by these methods contain high degree vertices. If these graphs are to used in the design of actual communication networks (for example for parallel computers) other considerations can override the need for minimum broadcasting time. So we are interested in networks with a fixed maximum degree, in which every vertex can broadcast quickly. Here, we study the broadcasting time of the Bruijn and Kautz networks (which are among the best known families of interconnection networks for given degree and diameter). These networks have a simple broadcasting scheme and for small degree they have a very good broadcasting time of order log n. For example for maximum degree 4, we obtain networks on 2b or 2D + 2D-1 vertices, with broadcasting time at most 1.5 D, improving on carlier results.
Complete list of metadata
Contributor : Jean-Claude Bermond Connect in order to contact the contributor
Submitted on : Wednesday, November 18, 2020 - 11:05:02 PM
Last modification on : Friday, November 20, 2020 - 3:23:16 AM
Long-term archiving on: : Friday, February 19, 2021 - 8:57:51 PM


Files produced by the author(s)


  • HAL Id : hal-03013393, version 1



Jean-Claude Bermond, Claudine Peyrat. Broascasting in de Bruijn networks. Congressus Numerantium, Utilitas Mathematica Publishing, 1988, 66, pp.283-292. ⟨hal-03013393⟩



Record views


Files downloads