Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …

Broadcasting and gossiping are fundamental tasks in network communication. In
broadcasting, or one‐to‐all communication, information originally held in one node of the …

In this paper we are interested in synchronous distributed systems subject to transient and
ubiquitous failures. This includes systems where failures will occur on any communication …

Network? ow optimization problems may arise in a wide variety of important? elds, such as
transportation, telecommunication, computer networking,? nancial planning, logistics and …

We consider the broadcasting problem in the shouting communication mode in which any
node of a network can inform all its neighbors in one time step. In addition, during any time …

We consider the problem of broadcasting in the n-dimensional hypercube under the
hypothesis that each node can inform in one unit of time all of its n neighbors and that anyn …

We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting
communication mode, ie any node of a network can inform all its neighbours in one time …

We consider broadcasting with a linearly bounded number of transmission failures. For a
constant parameter 0< α< 1 we assume that at most αi faulty transmissions can occur during …

In this paper we are interested in synchronous distributed systems subject to transient and
ubiquitous failures. This includes systems where failures will occur on any communication …

We investigate the problem of broadcasting in a complete synchronous network with
dynamic edge faults. The faults may be loss of messages only (omissions) or of arbitrary …