A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM journal on computing (Print)
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 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 towards the weakest conditions under which consensus is solvable, ourdoi:10.1137/s009753970443999x fatcat:h7adimj3r5amhkp33irl4xegcu