Metraipolis › archive › dc_c71ee3da87c7

KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version) — arXiv:2609.31302

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31302
License (as archived)
CC0-1.0
Archived
2026-10-08T02:04:52.526Z
SHA-256 of the archived text
6ca03e336e6d268dd690b7d7e126b115b17753e9f80fe23cd4a87bdf8667bef9
Stable URL of this page
https://metraipolis.com/documento/dc_c71ee3da87c7

How to cite

KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version) — arXiv:2609.31302 — arXiv (en), https://arxiv.org/abs/2609.31302 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c71ee3da87c7 (Metraipolis archive dc_c71ee3da87c7, sha256 6ca03e336e6d268dd690b7d7e126b115b17753e9f80fe23cd4a87bdf8667bef9)
BibTeX
@misc{dcc71ee3da87c7,
  title = {KCensus: Synthesizing Latency-Optimal Consensus Fast Paths (Extended Version) — arXiv:2609.31302},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31302},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c71ee3da87c7; sha256 6ca03e336e6d268dd690b7d7e126b115b17753e9f80fe23cd4a87bdf8667bef9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31302. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Strongly consistent geo-replication often relies on fast paths to reduce latency in the common case of no failures or contention. Existing fast-path schemes, however, are ad hoc and restrictive: each corresponds to a point in a broad design space shaped by network topology, workload, and latency objective, so no single scheme works best across settings. This paper looks at fast-path schemes from a new perspective, as mechanisms that spread knowledge about proposals. With this view, we identify a fundamental condition on the spread of knowledge for a fast-path scheme to work. We then introduce KCensus, a framework that turns this condition into an optimization problem, synthesizing new fast-path schemes that are optimal for a given setting. We use KCensus to build a geo-replicated key-value store and evaluate it across AWS regions. Our system outperforms competing protocols, with up to 16% lower average latency.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-28 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.31302 — 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-08T01:40:22.290Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).