Selecting a distributed agreement algorithm

Authors:
Robert John Walters;Peter Henderson;Stephen Crouch
Affiliations:
University of Sothampton Highfield, Southampton, United Kingdom;University of Sothampton Highfield, Southampton, United Kingdom;University of Sothampton Highfield, Southampton, United Kingdom
Venue:
Proceedings of the 2007 ACM symposium on Applied computing
Year:
2007

Citing 4
Cited 2

COM and DCOM: Microsoft's vision for distributed objects

COM and DCOM: Microsoft's vision for distributed objects
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Designing Applications with MSMQ: Message Queuing for Developers

Designing Applications with MSMQ: Message Queuing for Developers
Belief Revision: A Critique

Journal of Logic, Language and Information

Byzantine generals' problem driven dynamic trust replication method for cognitive mobile ad hoc networks (MANETs)

DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers
Towards a hierarchical temporal memory based self-managed dynamic trust replication mechanism in cognitive mobile ad-hoc networks

AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

When component parts of distributed systems need to reach agreement, arriving at consensus is difficult if some components don't behave properly. The Byzantine Generals Problem described by Lamport and others exemplifies the difficulty. In a real situation, components don't know which of their peers are faulty and hence they cannot apply the algorithms of Lamport et al, nor even decide if a suitable algorithm exists. This paper discusses options available in this situation and describes how a good expectation of arriving at a consensus can be achieved without knowing for certain which or how many participants are behaving badly.