The Weakest Failure Detector to Implement a Register in Asynchronous Systems with Hybrid Communication

2011 ◽  
pp. 268-282 ◽  
Author(s):  
Damien Imbs ◽  
Michel Raynal
Keyword(s):  
Asynchronous Systems ◽  
Failure Detector

scholarly journals The weakest failure detector to implement a register in asynchronous systems with hybrid communication

2013 ◽  
Vol 512 ◽  
pp. 130-142 ◽  
Author(s):  
Damien Imbs ◽  
Michel Raynal
Keyword(s):  
Asynchronous Systems ◽  
Failure Detector

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.

EFFICIENT SOLUTION TO UNIFORM ATOMIC BROADCAST

2002 ◽  
Vol 13 (05) ◽  
pp. 695-717
Author(s):  
Emmanuelle ANCEAUME
Keyword(s):  
Efficient Solution ◽  
Asynchronous Systems ◽  
Consensus Problem ◽  
Failure Detector ◽  
Asynchronous System ◽  
New Approach ◽  
Atomic Broadcast ◽  
Crash Failures ◽  
Unreliable Failure Detector

Chandra and Toueg proposed in 1993 a new approach to overcome the impossibility of reaching deterministically Consensus — and by corollary Atomic Broadcast — in asynchronous systems subject to crash failures. They augment the asynchronous system with a possibly Unreliable Failure Detector which provides some information about the operational state of processes. In this paper, we present an extension of the Consensus problem that we call Uniform Prefix Agreement. This extension enables all the processes to propose a flow of messages during an execution — instead of one as in the Consensus problem — and uses all these proposed messages to compose the decision value. Prefix Agreement is based on an Unreliable Failure Detector. We use repeated executions of Prefix Agreement to build an efficient Uniform Atomic Broadcast algorithm. This paper describes the Uniform Prefix Agreement and Uniform Atomic Broadcast algorithms, and provides proofs of their correctness.

scholarly journals Integration of Failure Detector in Bias Filter for Estimation of False Data Injection Cyberattacks

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 40823-40835
Author(s):  
Adel Tabakhpour Langeroudi ◽  
Morad Mohamed Abdelmageed Abdelaziz
Keyword(s):  
Failure Detector ◽  
False Data Injection

scholarly journals The reactive simulatability (RSIM) framework for asynchronous systems

2007 ◽  
Vol 205 (12) ◽  
pp. 1685-1720 ◽  
Author(s):  
Michael Backes ◽  
Birgit Pfitzmann ◽  
Michael Waidner
Keyword(s):  
Asynchronous Systems ◽  
Reactive Simulatability

scholarly journals An energy-efficient failure detector for vehicular cloud computing

PLoS ONE ◽  
2018 ◽  
Vol 13 (1) ◽  
pp. e0191577 ◽  
Author(s):  
Jiaxi Liu ◽  
Zhibo Wu ◽  
Jian Dong ◽  
Jin Wu ◽  
Dongxin Wen
Keyword(s):  
Cloud Computing ◽  
Energy Efficient ◽  
Failure Detector ◽  
Vehicular Cloud Computing ◽  
Vehicular Cloud

Exception Handling in Timed Asynchronous Systems

2002 ◽  
pp. 209-227 ◽  
Author(s):  
Robert Miller ◽  
Anand Tripathi
Keyword(s):  
Exception Handling ◽  
Asynchronous Systems
Sign in / Sign up

Export Citation Format

Share Document