Selecting a Distributed Agreement Algorithm
Selecting a Distributed Agreement Algorithm
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.
Distributed agreement, Byzantine Generals Problem
1-59593-480-4
586-587
Crouch, Stephen
a136ad57-82ec-4664-8d8e-79a605808e6d
Henderson, Peter
bf0a7293-7277-459d-9c3c-67b0a6eabd54
Walters, Robert J
7b8732fb-3083-4f4d-844e-85a29daaa2c1
2007
Crouch, Stephen
a136ad57-82ec-4664-8d8e-79a605808e6d
Henderson, Peter
bf0a7293-7277-459d-9c3c-67b0a6eabd54
Walters, Robert J
7b8732fb-3083-4f4d-844e-85a29daaa2c1
Crouch, Stephen, Henderson, Peter and Walters, Robert J
(2007)
Selecting a Distributed Agreement Algorithm.
The 2007 ACM Syposium on Applied Computing, Seoul, South Korea.
11 - 15 Mar 2007.
.
Record type:
Conference or Workshop Item
(Poster)
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.
Text
BGP2006_3_shortC.pdf
- Other
More information
Published date: 2007
Additional Information:
Event Dates: March 11-15, 2007
Venue - Dates:
The 2007 ACM Syposium on Applied Computing, Seoul, South Korea, 2007-03-11 - 2007-03-15
Keywords:
Distributed agreement, Byzantine Generals Problem
Organisations:
Web & Internet Science, Electronic & Software Systems
Identifiers
Local EPrints ID: 263732
URI: http://eprints.soton.ac.uk/id/eprint/263732
ISBN: 1-59593-480-4
PURE UUID: 23afb91c-7376-42eb-af8b-659eb8828a97
Catalogue record
Date deposited: 22 Mar 2007
Last modified: 15 Mar 2024 03:09
Export record
Contributors
Author:
Stephen Crouch
Author:
Peter Henderson
Author:
Robert J Walters
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics