Easy impossibility proofs for distributed consensus problems
Distributed Computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Wakeup under Read/Write Atomicity
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Efficient Algorithms for Anonymous Byzantine Agreement
Theory of Computing Systems
Fault-Tolerant Consensus in Unknown and Anonymous Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
The anonymous consensus hierarchy and naming problems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Brief announcement: byzantine agreement with homonyms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Homonyms with forgeable identifiers
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
Hi-index | 0.00 |
So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general model: namely, n processes use l different authenticated identifiers, where 1 ≤ l ≤ n. In this paper, we ask how many identifiers are actually needed to reach agreement in a distributed system with t Byzantine processes. We show that having 3t+1 identifiers is necessary and sufficient for agreement in the synchronous case but, more surprisingly, the number of identifiers must be greater than n+3t/2 in the partially synchronous case. This demonstrates two differences from the classical model (which has l=n): there are situations where relaxing synchrony to partial synchrony renders agreement impossible; and, in the partially synchronous case, increasing the number of correct processes can actually make it harder to reach agreement. The impossibility proofs use the fact that a Byzantine process can send multiple messages to the same recipient in a round. We show that removing this ability makes agreement easier: then, t+1 identifiers are sufficient for agreement, even in the partially synchronous model.