Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Optimal Group Gossiping in Hypercubes Under A Circuit-Switching Model
SIAM Journal on Computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Distributed Algorithms
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Gossiping by processors prone to omission failures
Information Processing Letters
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the impact of faulty processors on the communication cost of distributed algorithms in a message-passing model. The system is synchronous but prone to various kinds of processor failures: crashes, message omissions, (authenticated) Byzantine faults. One of the basic communication tasks, called fault-tolerant gossip, or gossip for short, is to exchange the initial values among all non-faulty processors. In this paper we address the question if there is a gossip algorithm which is both fault-tolerant, fast and communication-efficient? We answer this question in affirmative in the model allowing only crash failures, and in some sense negatively when the other kinds of failures may occur. More precisely, in an execution by n processors when f of them are faulty, each non-faulty processor contributes a constant to the message complexity, each crashed processor contributes Θ(fε) (ε 0 could be an arbitrarily small constant independent from n, f but dependent on the algorithm), each omission (or authenticated Byzantine) processor contributes Θ(t), and each--even potential--Byzantine failure results in additional Θ(n) messages sent.