Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters
Distributed Algorithms
A Layered Analysis of Consensus
SIAM Journal on Computing
Consensus in Synchronous Systems: A Concise Guided Tour
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Dynamic faults have small effect on broadcasting in hypercubes
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing
| Hi-index | 0.00 |
We compare the solvability of the Consensus and Broadcast problems in synchronous communication networks in which the delivery of messages is not reliable. The failure model is the mobile omission faults model. During each round, some messages can be lost and the set of possible simultaneous losses is the same for each round. We investigate these problems for the first time for arbitrary sets of possible failures. Previously, these sets were defined by bounding the numbers of failures. In this setting, we present a new necessary condition for the solvability of Consensus that unifies previous impossibility results in this area. This condition is expressed using Broadcastability properties. As a very important application, we show that when the sets of omissions that can occur are defined by bounding the numbers of failures, counted in any way (locally, globally, etc.), then the Consensus problem is actually equivalent to the Broadcast problem.