Anonymous Agreement: The Janus Algorithm

Bouzid, Zohir; Sutra, Pierre; Travers, Corentin

doi:10.1007/978-3-642-25873-2_13

Cited by 6 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This service as has been extensively studied in classic distributed systems, Le., in which each process has a unique identifier ( [2], [3], [4]). On the other hand, this study in anonymous distributed systems, Le., processes have no identifiers and are programmed identically [5], has few result. In [6], the RB abstraction has been studied in anonymous distributed systems with reliable communication channels.…”

Section: Reliable Broadcastmentioning

confidence: 99%

Reliable broadcast in anonymous distributed systems with fair lossy channels

Viñuales

Tang

Larrea³

et al. 2017

IJHPCN

View full text Add to dashboard Cite

Abstract-Reliable Broadcast (RB) is a basic abstraction in distributed systems, because it allows processes to communicate consistently and reliably to each other. It guarantees that all correct process reliable deliver the same set of messages. This abstraction has been extensively investigated in distributed systems where all processes have different identifiers, and the communication channels are reliable. However, more and more anonymous systems appear due to the motivation of privacy. It is significant to extend RB into anonymous system model where each process has no identifier. In another hand, the requirement of reliable communication channels is not always satisfied in real systems. Henee, this paper is aimed to study RB abstraction in anonymous distributed systems with fair lossy communication channels.In distributed systems, symmetry always mean that two systems should be considered symmetric if they behave identically, and two components of a system should be considered symmetric if they are indistinguishable. Henee, the anonymous distributed systems is symmetry. The design difficulty of RB algorithm lies in how to break the symmetry of the system. In this paper, we propose to use a random function to break it. Firstly, a non-quiescent RB algorithm tolerating an arbitrary number of crashed processes is given. Then, we introduce an anonymous perfect failure detector AP*. Finally, we propose an extended and quiescent RB algorithm using AP*.

show abstract

Section: Reliable Broadcastmentioning

confidence: 99%

Reliable broadcast in anonymous distributed systems with fair lossy channels

Viñuales

Tang

Larrea³

et al. 2017

IJHPCN

View full text Add to dashboard Cite

show abstract

“…Task 1: (4) while true do (5) if (leaderi) then (6) seqi <-se<K + 1; (7) broadcast(HB, seqi) (8) end if; (9) wait until timeouti units: (10) if (leaderi) then (11) let reci be the set of (ACK.HB, s, s') received such that s < seqi < s'- (12) quantityi <-|»*eci (13) else (14) let reci be the set of new (ACK.HB, -, -) received: (15) if (reci = 0) then leaderi *-true end if (16) end if (17) end while.…”

Section: Initmentioning

confidence: 99%

“…For every process /? ; that finished round k, the variable esti can be changed in round k + l with the proposed value est broadcast in phase PHO by some process (lines [8][9][10]. After that, the variable esti can only be changed with proposed values est broadcast by processes in phase PHI (line 14) and PH2 (line 20).…”

Section: Lemmamentioning

confidence: 99%

“…Furthermore, AQ has the important drawback that it is an anonymous shared memory system bounding the step complexity (i.e., the number of shared memory accesses) to 0(n) by each invocation on a read/write operation, being n the number of processes of the system. In [9] and [14], the failure detector AQ [6] is used to solve consensus and there is no bounds in the number of crashed processes. In [9], the shared memory is formed by atomic multi-writer and multi-reader registers, and in [14], these shared memory is made up by the weak set object (this object is a set from which values are never removed).…”

Section: Introductionmentioning

confidence: 99%

“…In [9] and [14], the failure detector AQ [6] is used to solve consensus and there is no bounds in the number of crashed processes. In [9], the shared memory is formed by atomic multi-writer and multi-reader registers, and in [14], these shared memory is made up by the weak set object (this object is a set from which values are never removed). In [4], the authors implement consensus in an anonymous shared memory where no processes can crash and where the shared memory is implemented using atomic registers (namely, Q (log n) is the number of atomic registers needed to solve consensus).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Eventual election of multiple leaders for solving consensus in anonymous systems

et al. 2015

View full text Add to dashboard Cite

In classical distributed systems, each process has a unique identity. Today, new distributed systems have emerged where a unique identity is not always possible to be assigned to each process. For example, in many sensor networks a unique identity is not possible to be included in each device due to its small storage capacity, reduced computational power, or the huge number of devices to be identified. In these cases, we have to work with anonymous distributed systems where processes cannot be identified. Consensus cannot be solved in classical and anonymous asynchronous distributed systems where processes can crash. To bypass this impossibility result, failure detectors are added to these systems. It is known that Q is the weakest failure detector class for solving consensus in classical asynchronous systems when a majority of processes never crashes. Although AQ was introduced as an anonymous version of Q, to And the weakest failure detector in anonymous systems to solve consensus when a majority of processes never crashes is nowadays an open question. Furthermore, AQ has the important drawback that it is not implementable. Very recently, AQ' has been introduced as a counterpart of Q for anonymous systems. In this paper, we show that the AQ' failure detector class is strictly weaker than AQ (i.e., AQ' provides less information about process crashes than AQ). We also present in this paper the first implementation of AQ' (hence, we also show that AQ' is implementable), and, finally, we include the first implementation of consensus in anonymous asynchronous systems augmented with AQ' and where a majority of processes does not crash.

show abstract