Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2202.09123 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910293626454016 |
|---|---|
| author | Cohen, Shir Keidar, Idit Spiegelman, Alexander |
| author_facet | Cohen, Shir Keidar, Idit Spiegelman, Alexander |
| contents | Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\leq f\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2202_09123 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Make Every Word Count: Adaptive BA with Fewer Words Cohen, Shir Keidar, Idit Spiegelman, Alexander Distributed, Parallel, and Cluster Computing Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\leq f\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in the failure-free case and a quadratic cost otherwise. |
| title | Make Every Word Count: Adaptive BA with Fewer Words |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2202.09123 |