Metraipolis › archive › dc_cc56db2a1b1e
Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN — arXiv:2609.39715
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39715
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T13:14:54.404Z
- SHA-256 of the archived text
7b2039e1d54d532ecb2984b6a0ff099abf2c687a3a58f9c5951def83323c5015- Stable URL of this page
https://metraipolis.com/documento/dc_cc56db2a1b1e
How to cite
Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN — arXiv:2609.39715 — arXiv (en), https://arxiv.org/abs/2609.39715 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cc56db2a1b1e (Metraipolis archive dc_cc56db2a1b1e, sha256 7b2039e1d54d532ecb2984b6a0ff099abf2c687a3a58f9c5951def83323c5015)
BibTeX
@misc{dccc56db2a1b1e,
title = {Exploring Adaptive Byzantine Quorum Systems to Improve Latency in the WAN — arXiv:2609.39715},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39715},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cc56db2a1b1e; sha256 7b2039e1d54d532ecb2984b6a0ff099abf2c687a3a58f9c5951def83323c5015},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39715. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quorum systems enforce strict consistency in Byzantine fault-tolerant (BFT) state machine replication: Before a value is decided, a subset of replicas (called quorum) must exchange votes for the value. In wide-area networks, the size and composition of a quorum determines the speed at which replicas can make progress and thus impacts the latency perceived by clients. A variety of quorum constructions has been proposed, e.g., threshold, weighted, grid and others, but the literature offers little in the way of an apples-to-apples comparison. Each construction typically lives inside a different protocol implementation, so the influence of quorum design on client latency cannot be easily separated from other implementation effects, especially the use of optimization techniques. In this paper, we close that gap by extending BFT-SMaRt with a modular quorum-system abstraction that allows a variety of quorum constructions to live inside the same framework and interact with the same set of optimization techniques. Via our framework, we explore the impact of different quorum system constructions on client-observed latency in wide-area BFT replication using network simulation. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DC). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.39715 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T12:46:39.728Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).