QuePaxa: Escaping the tyranny of timeouts in consensus

P Tennage, C Basescu, L Kokoris-Kogias… - Proceedings of the 29th …, 2023 - dl.acm.org
Leader-based consensus algorithms are fast and efficient under normal conditions, but lack
robustness to adverse conditions due to their reliance on timeouts for liveness. We present …

RACS and SADL: Towards Robust SMR in the Wide-Area Network

P Tennage, A Desjardins, L Kokoris-Kogias - arXiv preprint arXiv …, 2024 - arxiv.org
Consensus algorithms deployed in the crash fault tolerant setting chose a leader-based
architecture in order to achieve the lowest latency possible. However, when deployed in the …

Mandator and Sporades: Robust wide-area consensus with efficient request dissemination

P Tennage, A Desjardins, EK Kogias - arXiv preprint arXiv:2209.06152, 2022 - arxiv.org
Consensus algorithms are deployed in the wide area to achieve high availability for
geographically replicated applications. Wide-area consensus is challenging due to two main …

Service-to-SLA lifecycle model with blockchain management

I Chenchev - AIP Conference Proceedings, 2024 - pubs.aip.org
Essential elements of the proper measurement of a service are its design, model (for this
research is vital to how a service could be mapped into the used infrastructure components) …

BFT Baxos: Robust and Efficient BFT Consensus using Random Backoff

Z Cui - 2024 - diva-portal.org
BFT consensus algorithms can ensure the consistency of distributed systems where nodes
may behave arbitrarily due to faults or intentional malicious actions. However, most of the …