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

We consider the problem of reliably broadcasting a message in a multihop network. We
assume that some nodes may be Byzantine, and behave arbitrarily. We focus on …

We consider broadcasting from a fault-free source to all nodes of a completely connected n-
node network in the presence of k faulty nodes. Every node can communicate with at most …

Broadcasting is a process of transmitting a message held in one node of a communication
network to all other nodes. Links of the network are subject to randomly and independently …

Every node of a communication network has a constant size value which should be made
known to all other nodes. Nodes and links fail independently with constant probabilities p<1 …

We study all-to-all broadcasting in hypercubes with randomly distributed Byzantine faults.
We construct an efficient broadcasting scheme BC1-n-cube running on the n-dimensional …

We consider the problem of efficient information exchange in a communication network
whose nodes and/or links are subject to Byzantine faults that are randomly and …

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 …

Let Γ be an arrangement of pseudo-lines, ie, a collection of unbounded x-monotone curves
in which each curve crosses each of the others exactly once. A pseudo-line graph (ΓT, E) is …

In a context where networks grow larger and larger, their nodes become more likely to fail.
Indeed, they may be subject to crashes, attacks, memory corruptions… To encompass all …