Synchronous consensus under hybrid process and link failures

摘要: We introduce a comprehensive hybrid failure model for synchronous distributed systems, which extends conventional process by adding communication failures: Every in the system is allowed to commit up f?s send link failures and experience f?r receive per round here, without being considered faulty; some f?sa?f?s f?ra?f?r among those may even cause erroneous messages rather than just omissions. In companion paper (Schmid et al. (2009) 14), devoted complete suite of related impossibility results lower bounds, we proved that this surpasses all existing modeling approaches terms assumption coverage simple probabilistic setting.In paper, show several well-known consensus algorithms can be adapted work under our model, provided number processes required tolerating increased small integer multiples f?s, f?r, f?sa, f?ra. This somewhat surprising, given presence unrestricted mobile (moving) omission impossible. provide detailed formulas rounds, reveal bounds established are tight. also explore power limitations authentication setting, consider uniform algorithms, guarantee their properties benign faulty processes.