Notice of Violation of IEEE Publication Principles: A stable election protocol based on an unreliable failure detector in distributed systems

2011 ◽  
Author(s):  
Sung-Hoon Park
Keyword(s):  
Distributed Systems ◽  
Failure Detector ◽  
Stable Election Protocol ◽  
Unreliable Failure Detector

An Unreliable Failure Detector for Unknown and Mobile Networks

2008 ◽  
pp. 555-559 ◽  
Author(s):  
Pierre Sens ◽  
Luciana Arantes ◽  
Mathieu Bouillaguet ◽  
Véronique Simon ◽  
Fabíola Greve
Keyword(s):  
Mobile Networks ◽  
Failure Detector ◽  
Unreliable Failure Detector

A security management scheme for failure detector distributed systems based on self-tuning control theory

2009 ◽  
Vol 22 (2) ◽  
pp. 333-342 ◽  
Author(s):  
Naixue Xiong ◽  
Jong Hyuk Park ◽  
Laurence T. Yang ◽  
Byoung-Soo Koh ◽  
Yingshu Li
Keyword(s):  
Distributed Systems ◽  
Control Theory ◽  
Security Management ◽  
Failure Detector ◽  
Management Scheme ◽  
Self Tuning

scholarly journals Consensus in anonymous asynchronous systems with crash-recovery and omission failures

Computing ◽  
2021 ◽  
Author(s):  
Ernesto Jiménez ◽  
José Luis López-Presa ◽  
Marta Patiño-Martínez
Keyword(s):  
Distributed Systems ◽  
Fundamental Problem ◽  
Asynchronous Systems ◽  
Failure Model ◽  
Failure Detectors ◽  
Fair Exchange ◽  
Failure Detector ◽  
Distributed Object ◽  
Failure Models ◽  
Crash Recovery

AbstractIn anonymous distributed systems, processes are indistinguishable because they have no identity and execute the same algorithm. Currently, anonymous systems are receiving a lot of attention mainly because they preserve privacy, which is an important property when we want to avoid impersonation attacks. On the other hand, Consensus is a fundamental problem in distributed computing. It is well-known that Consensus cannot be deterministically solved in pure asynchronous anonymous systems if processes can crash (the so-called crash-stop failure model). This impossibility holds even if message losses never occur in transmission. Failure detectors are an elegant and powerful abstraction for achieving deterministic Consensus in asynchronous distributed systems. A failure detector is a distributed object that gives the processes information about crashed processes. Failure detectors have attracted so much attention in the crash-stop failure model because they provide a totally independent abstraction. $$\varOmega $$ Ω is the weakest failure detector to solve Consensus in classic asynchronous systems when a majority of processes never crash, and $$A\varOmega '$$ A Ω ′ is its implementable version for anonymous systems. As far as we know, there is a lack of works in the literature which tackle Consensus in anonymous asynchronous systems where crashed process can recover (the so-called crash-recovery failure model) and also assuming errors in transmission operations (the so-called omission failure model). Extending failure models in the system allows us to design more realistic systems and solve more practical security problems (i.e., fair exchange and the secure multiparty computation). We present, in this paper, an algorithm to solve Consensus using $$A\varOmega '$$ A Ω ′ in anonymous asynchronous systems under the crash-recovery and omission failure models. Another important contribution of this paper is a communication-efficient and latency-efficient implementation of $$A\varOmega '$$ A Ω ′ for these new failure models.

$\diamondsuit {\mathcal P}_{mute}$-BASED CONSENSUS for ASYNCHRONOUS BYZANTINE SYSTEMS

2005 ◽  
Vol 15 (01n02) ◽  
pp. 169-182 ◽  
Author(s):  
ROY FRIEDMAN ◽  
ACHOUR MOSTEFAOUI ◽  
MICHEL RAYNAL
Keyword(s):  
Design Principle ◽  
The Other ◽  
Failure Detectors ◽  
Message Complexity ◽  
Failure Detector ◽  
Consensus Protocol ◽  
Correct Process ◽  
Byzantine Failures ◽  
Round Number ◽  
Unreliable Failure Detector

This paper presents a consensus protocol for asynchronous distributed systems made up of n processes, where up to f<n/4 processes can behave arbitrarily (Byzantine processes). The protocol assumes that the underlying system is equipped with an unreliable failure detector of the class [Formula: see text]. The failure detectors of the class [Formula: see text] ensure that (1) all mute processes are detected (a mute process is a process that, after some time, stops sending protocol messages), and (2) after some unknown but finite time, no correct process is suspected (mute processes are a subset of the Byzantine processes). The proposed protocol enjoys the following properties. It is based on the round coordinator paradigm and its design principle is particularly simple. Its message complexity is O(n2) per round. In addition to a round number, the message size is O(1), except for one message per round (sent by the round coordinator) whose size is O(n). The protocol does not use message "proofs", certificates, or application level signatures. When no process is faulty, all processes propose the same value, and the failure detector makes no mistake, the processes decide in one round (4 communication steps). Finally, when a process decides, it only needs a simple unreliable broadcast mechanism to prevent the other processes from deadlocking. All these features make the protocol attractive to cope with the net effect of Byzantine failures and asynchrony.

Sign in / Sign up

Export Citation Format

Share Document