The University of Southampton
University of Southampton Institutional Repository

Selecting a Distributed Agreement Algorithm

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
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. At The 2007 ACM Syposium on Applied Computing The 2007 ACM Syposium on Applied Computing. 11 - 15 Mar 2007. pp. 586-587.

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.

PDF BGP2006_3_shortC.pdf - Other
Download (23kB)

More information

Published date: 2007
Additional Information: Event Dates: March 11-15, 2007
Venue - Dates: The 2007 ACM Syposium on Applied Computing, 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: https://eprints.soton.ac.uk/id/eprint/263732
ISBN: 1-59593-480-4
PURE UUID: 23afb91c-7376-42eb-af8b-659eb8828a97
ORCID for Stephen Crouch: ORCID iD orcid.org/0000-0001-8985-6814

Catalogue record

Date deposited: 22 Mar 2007
Last modified: 06 Jun 2018 12:50

Export record

Contributors

Author: Stephen Crouch ORCID iD
Author: Peter Henderson
Author: Robert J Walters

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×