Results 1 
5 of
5
Communication Complexity of FaultTolerant Information Diffusion
 in: Proceedings of Fifth IEEE Symposium on Parallel and Distributed Processing
, 1993
"... This paper considers problems of faulttolerant information diffusion in a network with cost function. We show that the problem of determining the minimum cost necessary to perform fault tolerant gossiping among a given set of participants is NPhard and give approximate (with respect to the cost ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
This paper considers problems of faulttolerant information diffusion in a network with cost function. We show that the problem of determining the minimum cost necessary to perform fault tolerant gossiping among a given set of participants is NPhard and give approximate (with respect to the cost) faulttolerant gossiping algorithms. We also analyze the communication time and communication complexity of faulttolerant gossiping algorithms. Finally, we give an optimal cost fault tolerant broadcasting algorithm and apply our results to the atomic commitment problem. Key Words: Communication Networks, Gossiping, Atomic Commitment, FaultTolerance. Research partially supported by the Italian Ministry of University and of Scientific Research in the framework of the "Algoritmi, Modelli di Calcolo e Strutture Informative" project. 1 Introduction In this paper we study the problems of faulttolerant broadcasting, gossiping, and atomic commitment in a weighted network. Gossiping in ...
Rapid AlmostComplete Broadcasting in Faulty Networks ∗
, 2008
"... This paper studies the problem of broadcasting in synchronous pointtopoint networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixe ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
This paper studies the problem of broadcasting in synchronous pointtopoint networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixed number T, or a fraction α, of sent messages can be lost depending on which quantity is larger. As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(D log n) where D is the diameter of the network and n is the number of vertices. Moreover, for complete graphs under some additional conditions (sense of direction, or α < 0.55) the remaining constant number of vertices can be informed in the same time, i.e. O(log n). 1
Deterministic Models of Communication Faults?
"... Abstract. In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the perfo ..."
Abstract
 Add to MetaCart
Abstract. In this paper we survey some results concerning the impact of faulty environments on the solvability and complexity of communication tasks. In particular, we focus on deterministic models of faults in synchronous networks, and show how different variations of the model influence the performance bounds of broadcasting algorithms. 1
Rapid AlmostComplete Broadcasting in Faulty Networks?
"... Abstract. This paper studies the problem of broadcasting in synchronous pointtopoint networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step ei ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. This paper studies the problem of broadcasting in synchronous pointtopoint networks, where one initiator owns a piece of information that has to be transmitted to all other vertices as fast as possible. The model of fractional dynamic faults with threshold is considered: in every step either a fixed number T, or a fraction α, of sent messages can be lost depending on which quantity is larger. As the main result we show that in complete graphs and hypercubes it is possible to inform all but a constant number of vertices, exhibiting only a logarithmic slowdown, i.e. in time O(D logn) where D is the diameter of the network and n is the number of vertices. Moreover, for complete graphs under some additional conditions (sense of direction, or α < 0.55) the remaining constant number of vertices can be informed in the same time, i.e. O(logn). 1