Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Fault tolerance in networks of bounded degree
SIAM Journal on Computing
The best of both worlds: guaranteeing termination in fast randomized Byzantine agreement protocols
Information Processing Letters
Time and message efficient reliable broadcasts
Proceedings of the 4th international workshop on Distributed algorithms
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Time- and space-efficient randomized consensus
Journal of Algorithms
Tolerating a linear number of faults in networks of bounded degree
Information and Computation
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Fully Polynomial Byzantine Agreement for Processors in Rounds
SIAM Journal on Computing
A tight lower bound for randomized synchronous consensus
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus
Journal of the ACM (JACM)
Spreading rumors rapidly despite an adversary
Journal of Algorithms
Performing Work Efficiently in the Presence of Faults
SIAM Journal on Computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient gossip and robust distributed computation
Theoretical Computer Science
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
When agents communicate hypotheses in critical situations
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Hi-index | 0.00 |
We consider the problem of gossiping when dynamic node crashes are controlled by adaptive adversaries. We develop gossiping algorithms which are efficient with respect to both the time and communication measured as the number of point-to-point messages. If the adversary is allowed to fail up to $t$ nodes, among the total of $n$, where additionally $n-t=\Omega(n/\textpolylog n)$, then one among our algorithms completes gossiping in time $\cO(\log^2 t)$ and with $\cO(n\text polylog t)$ messages. We prove a lower bound which states that the time has to be at least $\Omega\Big(\frac\log n\log(n\log n)-\log t\Big)$ if the communication is restricted to be $\cO(n\text polylog n)$.We also show that one can solve efficiently a more demanding consensus problem with crash failures by resorting to one of our gossiping algorithms. If the adversary is allowed to fail $t$ nodes, where $n-t=\Omega(n/\textpolylog n)$, we obtain a time-optimal solution that is away from the communication optimality by at most a polylogarithmic factor.