Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913342931599360 |
|---|---|
| author | D'Amato, Francesco Losa, Giuliano Zanolini, Luca |
| author_facet | D'Amato, Francesco Losa, Giuliano Zanolini, Luca |
| contents | Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However, dynamically available TOB protocols are synchronous protocols, and they lose their safety guarantees during periods of asynchrony. This is a major issue in practice.
In this paper, we propose a simple but effective mechanism for tolerating bounded periods of asynchrony in dynamically available TOB protocols that ensure safety deterministically. We propose to trade off assumptions limiting the online/offline churn rate in exchange for tolerating bounded asynchronous periods through the use of a configurable message-expiration period.
In practice, this allows picking a small synchrony bound $δ$, and therefore obtain a fast protocol in the common case, knowing that the protocol tolerates occasional periods of duration at most $π>δ$ during which the bound does not hold. We show how to apply this idea to a state-of-the-art protocol to make it tolerate bounded periods of asynchrony. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_05347 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols D'Amato, Francesco Losa, Giuliano Zanolini, Luca Distributed, Parallel, and Cluster Computing Dynamically available total-order broadcast (TOB) protocols tolerate fluctuating participation, e.g., as high as 99% of their participants going offline, which is especially useful in permissionless blockchain environments. However, dynamically available TOB protocols are synchronous protocols, and they lose their safety guarantees during periods of asynchrony. This is a major issue in practice. In this paper, we propose a simple but effective mechanism for tolerating bounded periods of asynchrony in dynamically available TOB protocols that ensure safety deterministically. We propose to trade off assumptions limiting the online/offline churn rate in exchange for tolerating bounded asynchronous periods through the use of a configurable message-expiration period. In practice, this allows picking a small synchrony bound $δ$, and therefore obtain a fast protocol in the common case, knowing that the protocol tolerates occasional periods of duration at most $π>δ$ during which the bound does not hold. We show how to apply this idea to a state-of-the-art protocol to make it tolerate bounded periods of asynchrony. |
| title | Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2309.05347 |