Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
Randomized algorithms
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing)
Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Texts in Theoretical Computer Science. An EATCS Series)
Efficient gossip and robust distributed computation
Theoretical Computer Science
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
On the communication surplus incurred by faulty processors
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.89 |
We consider the gossip problem in a synchronous message-passing system. Participating processors are prone to omission failures, that is, a faulty processor may fail to send or receive a message. The gossip problem in the fault-tolerant setting is defined as follows: every correct processor must learn the initial value of any other processor, unless the other one is faulty; in the latter case either the initial value or the information about the fault must be learned. We develop two efficient algorithms that solve the gossip problem in time O(logn), where n is the number of processors in the system. The first one is an explicit algorithm (i.e., constructed in polynomial time) sending O(nlogn+f^2) messages, and the second one reduces the message complexity to O(n+f^2), where f is the upper bound on the number of faulty processors.