Fault-Tolerant Consensus in Unknown and Anonymous Networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures. We provide algorithms to emulate registers and solve consensus under different synchrony assumptions. For this, we introduce a novel pseudo leader-election approach which allows a leader-based consensus implementation without breaking symmetry.

Keywords

Data Structures and Algorithms, Distributed, Parallel, and Cluster Computing

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/224052

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0903.3461
 http://arxiv.org/abs/0903.3461

Collections

arXiv