Efficient and robust adaptive consensus services based on oracles

Sampaio, Luciano Menezes Bezerra; Brasileiro, Francisco; Nunes, Raul Ceretta; Jansch-Pôrto, Ingrid

doi:10.1590/s0104-65002005000100004

Cited by 1 publication

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following the first theoretical results that aimed at proving the correctness of consensus protocols based on unreliable failure detection oracles, performance analysis of such protocols is now a research topic that has gained considerable attention [21,5,14,18,19,24].…”

Section: Related Workmentioning

confidence: 99%

“…They proposed the use of slowness oracles to allow a 3S-based consensus protocol to adapt itself to the changing load of the execution environment. In [19], Sampaio et al further investigated the use of slowness oracles in the design of 3S-based adaptive consensus services. In particular, they studied more elaborated implementations of such mechanism.…”

Section: Related Workmentioning

confidence: 99%

“…Actually, we run experiments using FD-Push and FD-Pull and chose for comparison the scenario in which each consensus protocol achieved the best performance[19].Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN'05) 0-7695-2282-3/05 $20.00 © 2005 IEEE…”

mentioning

confidence: 99%

See 2 more Smart Citations

Adaptive Indulgent Consensus

Sampaio

Brasileiro

2005 International Conference on Dependable Systems and Networks (DSN'05)

View full text Add to dashboard Cite

Due to their fundamental role in the design of faulttolerant distributed systems, consensus protocols have been widely studied. In particular, design and performance issues of indulgent consensus is a research topic that has gained considerable attention. Most of these protocols are asymmetric in the sense that different participants can assume different roles during the execution of the protocol. Usually, there is a process that assumes a "special" role and the others cooperate with it to finish the computation. However, the asymmetric structure of indulgent consensus protocols has a performance pitfall, specially when processes and communication channels are subject to considerable variability in load. The problem is that such protocols use an a priori agreed process ordering to select the process to perform the "special" role. We advocate that adaptive indulgent consensus protocols can be constructed by the introduction of an adaptive process ordering module. In this sense, it is proposed a generic implementation for this module. Based on this generic module we provide implementations of both 3S-and Ω-based adaptive indulgent consensus protocols. Further, we investigate their performance by means of simulation and real experiments over a widely distributed system. The experimental results obtained show that the adaptive consensus protocols can outperform their non-adaptive counterparts in as much as 50%.

show abstract