Fault-Tolerant Consensus in Unknown and Anonymous Networks

Simple item page
dc.creatorDelporte-Gallet, Carole
dc.creatorFauconnier, Hugues
dc.creatorTielmann, Andreas
dc.date2009-03-20
dc.date.accessioned2026-07-07T12:54:46Z
dc.date.available2026-07-07T12:54:46Z
dc.descriptionThis 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.
dc.identifierhttps://arxiv.org/abs/0903.3461
dc.identifierhttp://arxiv.org/abs/0903.3461
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224052
dc.subjectData Structures and Algorithms
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleFault-Tolerant Consensus in Unknown and Anonymous Networks
dc.typetext

Files

Collections

arXiv