Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Consensus vs. broadcast in communication networks with arbitrary mobile omission faults
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Brief announcement: tolerating permanent and transient value faults
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We provide a suite of impossibility results and lower bounds for the required number of processes and rounds for synchronous consensus under transient link failures. Our results show that consensus can be solved even in the presence of $O(n^2)$ moving omission and/or arbitrary link failures per round, provided that both the number of affected outgoing and incoming links of every process is bounded. Providing a step further toward the weakest conditions under which consensus is solvable, our findings are applicable to a variety of dynamic phenomena such as transient communication failures and end-to-end delay variations. We also prove that our model surpasses alternative link failure modeling approaches in terms of assumption coverage.