Broadcasting in a hypercube when some calls fail

https://doi.org/10.1016/0020-0190(91)90105-QGet rights and content

Abstract

In this paper, we consider broadcasting in the n-dimensional hypercube, under the assumption that a node can communicate simultaneously through all its ports. We prove that, if during each time unit at most n−1 calls fail, then the broadcasting time is n+o(n). even if the set of the faulty calls is different during each time unit.

References (12)

There are more references available in the full text version of this article.

Cited by (28)

  • On fractional dynamic faults with thresholds

    2008, Theoretical Computer Science
  • Optimal broadcasting in hypercubes with dynamic faults

    1999, Information Processing Letters
  • Packet Routing in Fixed-Connection Networks: A Survey

    1998, Journal of Parallel and Distributed Computing
View all citing articles on Scopus

This work is supported by the Research Program C3 of the CNRS and MRT, and by the Direction des Recherches et Etudes Techniques (DGA).

∗∗

This work is partly supported by the Research Program C3 of the CNRS and MRT.

View full text