Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910928245620736 |
|---|---|
| author | Naser-Pastoriza, Alejandro Chockler, Gregory Gotsman, Alexey Ryabinin, Fedor |
| author_facet | Naser-Pastoriza, Alejandro Chockler, Gregory Gotsman, Alexey Ryabinin, Fedor |
| contents | Communication channel failures are a major concern for the developers of modern fault-tolerant systems. However, while tight bounds for process failures are well-established, extending them to include channel failures has remained an open problem. We introduce \emph{generalized quorum systems} - a framework that characterizes the necessary and sufficient conditions for implementing atomic registers, atomic snapshots, lattice agreement and consensus under arbitrary patterns of process-channel failures. Generalized quorum systems relax the connectivity constraints of classical quorum systems: instead of requiring bidirectional reachability for every pair of write and read quorums, they only require some write quorum to be \emph{unidirectionally} reachable from some read quorum. This weak connectivity makes implementing registers particularly challenging, because it precludes the traditional request/response pattern of quorum access, making classical solutions like ABD inapplicable. To address this, we introduce novel logical clocks that allow write and read quorums to reliably track state updates without relying on bi-directional connectivity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02646 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version) Naser-Pastoriza, Alejandro Chockler, Gregory Gotsman, Alexey Ryabinin, Fedor Distributed, Parallel, and Cluster Computing Communication channel failures are a major concern for the developers of modern fault-tolerant systems. However, while tight bounds for process failures are well-established, extending them to include channel failures has remained an open problem. We introduce \emph{generalized quorum systems} - a framework that characterizes the necessary and sufficient conditions for implementing atomic registers, atomic snapshots, lattice agreement and consensus under arbitrary patterns of process-channel failures. Generalized quorum systems relax the connectivity constraints of classical quorum systems: instead of requiring bidirectional reachability for every pair of write and read quorums, they only require some write quorum to be \emph{unidirectionally} reachable from some read quorum. This weak connectivity makes implementing registers particularly challenging, because it precludes the traditional request/response pattern of quorum access, making classical solutions like ABD inapplicable. To address this, we introduce novel logical clocks that allow write and read quorums to reliably track state updates without relying on bi-directional connectivity. |
| title | Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version) |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2505.02646 |