Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks

Jeanneau, Denis; Rieutord, Thibault; Arantes, Luciana; Sens, Pierre

doi:10.1109/tpds.2016.2608829

Cited by 4 publications

(3 citation statements)

References 31 publications

(67 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Previous work on the solvability of consensus and -set agreement include the characterization of consensus solvability for oblivious round-based models of Coulouma et al [11], the failure-detectorbased approach of Jeanneau et al [19], and the focus on graceful degradation in algorihtms for -set agreement of Biely et al [3].…”

Section: Related Workmentioning

confidence: 99%

K-set agreement bounds in round-based models through combinatorial topology

Shimi

Castañeda²

2020

Proceedings of the 39th Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Round-based models are very common message-passing models; combinatorial topology applied to distributed computing provides sweeping results like general lower bounds. We combine both to study the computability of-set agreement. Among all the possible round-based models, we consider oblivious ones, where the constraints are given only round per round by a set of allowed graphs. And among oblivious models, we focus on closed-above ones, that is models where the set of possible graphs contains all graphs with more edges than some starting graphs. These capture intuitively the underlying structure required by some communication model, like containing a ring. We then derive lower bounds and upper bounds in one round for-set agreement, such that these bounds are proved using combinatorial topology but stated only in terms of graph properties. These bounds extend to multiple rounds when limiting our algorithms to be oblivious-recalling only pairs of processes and initial value, not who send what and when.

show abstract

Section: Related Workmentioning

confidence: 99%

K-set agreement bounds in round-based models through combinatorial topology

Shimi

Castañeda²

2020

Proceedings of the 39th Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…The main contribution in [41] was to identify the shortest period of stability that makes consensus feasible. In unknown and dynamic systems, Jeanneau et al [23] relied on failure detectors to solve k-set consensus. These works only studied synchronous systems, whereas we consider exact and approximate crash-tolerant consensus in asynchronous systems.…”

Section: A3 K-set Consensusmentioning

confidence: 99%

Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus

Sakavalas¹,

Tseng²,

Vaidya³

2018

Preprint

View full text Add to dashboard Cite

Consider a point-to-point message-passing network. We are interested in the asynchronous crash-tolerant consensus problem in incomplete networks. We study the feasibility and efficiency of approximate consensus under different restrictions on topology knowledge and the relay depth, i.e., the maximum number of hops any message can be relayed. These two constraints are common in large-scale networks, and are used to avoid memory overload and network congestion respectively. Specifically, for different values of integers k, k , we consider that each node knows all its neighbors of at most k-hop distance (k-hop topology knowledge), and the relay depth is k . We consider both directed and undirected graphs. More concretely, we answer the following main question in asynchronous systems: What is a tight condition on the underlying communication graphs for achieving approximate consensus if each node has only a k-hop topology knowledge and relay depth k ?To prove that the necessary conditions presented in the paper are also sufficient, we have developed algorithms that achieve consensus in graphs satisfying those conditions:The first class of algorithms requires k-hop topology knowledge and relay depth k. Unlike prior algorithms, these algorithms do not flood the network, and each node does not need the full topology knowledge. We show how the convergence time and the message complexity of those algorithms is affected by k, providing the respective upper bounds.The second set of algorithms requires only one-hop neighborhood knowledge, i.e., immediate incoming and outgoing neighbors, but needs to flood the network (i.e., relay depth is n, where n is the number of nodes). One result that may be of independent interest is a topology discovery mechanism to learn and "estimate" the topology in asynchronous directed networks with crash faults.2012 ACM Subject Classification CCS → Computer systems organization → Dependable and fault-tolerant systems and networks → Fault-tolerant network topologies

show abstract

“…Finally, failure detectors are also studied on Software-Defined Networking (SDN) environments as in Turchetti and Procopio Duarte [71] and Yang et al [77], IoT environment and Wireless Sensor Network (WSN) as in Yang et al [76] and Benkaouha et al [19], respectively, Ambient Assisted Living as in Junior et al [55] , High-Performance Computing (HPC) platforms as in Bosilca et al [23] and Zhong et al [78] and unknown dynamic networks as in Jeanneau et at. [53] .…”

Section: Chapter 6 Related Workmentioning

confidence: 99%

Failure detectors

Luis Scannapieco Neto

View full text Add to dashboard Cite

Há quase trinta anos atrás, entre 1991-1992, Chandra, Toueg e Hadzilacos introduziram o conceito de detetores de falhas e mostraram como usá-los para resolver consenso em sistemas distribuídos assíncronos sujeitos a falhas parciais. Durante os anos seguintes, a abstração de detetores de falhas provou ser uma ferramenta essencial para a engenharia de sistemas distribuídos de alta disponibilidade. Resumidamente, os detetores de falhas representam uma ferramenta elegante que permite aos projetistas de sistemas distribuídos fatorar as suposições de tempo usadas para detetar falhas em algoritmos de consenso distribuído. Atualmente, um número significativo de algoritmos de deteção de falhas já foi publicado; cada um deles trazendo, supostamente, uma melhor solução para deteção de falhas; geralmente com base em uma avaliação ad hoc do algoritmo proposto. A falta de um benchmark ou plataforma de testes comum para detetores de falhas representa um obstáculo extra para engenheiros de sistemas quando eles precisam escolher um detetor de falha adequado para sua aplicação. Nesse contexto, parece razoável fazer a seguinte pergunta: qual o melhor detetor de falhas para uma determinada aplicação, executada em um determinado sistema distribuído? Neste trabalho, uma aplicação é um sistema de replicação ativa desenvolvido sobre transmissão de difusão totalmente ordenada baseada em consenso (DTOC). DTOC é o denominador comum para um grande número de aplicações reais. Chen, Toueg e Aguilera (CTA) propuseram métricas para caracterizar a qualidade do serviço prestado por um detetor de falhas. As métricas quantificam: i) quão rápido um detetor de falhas deteta falhas reais e ii) quão bem ele evita falsas deteções. Esta dissertação propõe, implementa e avalia uma plataforma de testes para detetores de falhas com base nas métricas amplamente aceitas de CTA. Em seguida, utiliza essa plataforma para buscar uma resposta para a questão feita acima. As contribuições desta pesquisa são: (i) a proposta de um método experimental para avaliar uniformemente o comportamento dos detetores de falhas, (ii) a implementação de uma plataforma de testes para apoiar o método, e (iii) um estudo comparativo de quatro detetores de falhas conhecidos.

show abstract

Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks

Cited by 4 publications

References 31 publications

K-set agreement bounds in round-based models through combinatorial topology

K-set agreement bounds in round-based models through combinatorial topology

Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus

Failure detectors

Contact Info

Product

Resources

About