In this paper, we address the Approximate Agreement problem in the Mobile Byzantine Fault model. Our contribution is three-fold. First, we refine the problem specification to adapt it to the Mobile Byzantine Fault environment. Then, we propose the first mapping from the existing variants of Mobile Byzantine models to the Mixed-mode Fault model. This mapping further help us to prove the correctness of MSR (Mean-Subsequence-Reduce) algorithms class in our context and it is of independent interest. We also prove lower bounds for solving Approximate Agreement under all existing Mobile Byzantine fault models.
Approximate Agreement under Mobile Byzantine Faults / Bonomi, Silvia; Del Pozzo, Antonella; Potop-Butucaru, Maria; Tixeuil, Sébastien. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 758:(2018), pp. 17-29. [10.1016/j.tcs.2018.08.001]
Approximate Agreement under Mobile Byzantine Faults
Bonomi, Silvia
;Del Pozzo, Antonella;
2018
Abstract
In this paper, we address the Approximate Agreement problem in the Mobile Byzantine Fault model. Our contribution is three-fold. First, we refine the problem specification to adapt it to the Mobile Byzantine Fault environment. Then, we propose the first mapping from the existing variants of Mobile Byzantine models to the Mixed-mode Fault model. This mapping further help us to prove the correctness of MSR (Mean-Subsequence-Reduce) algorithms class in our context and it is of independent interest. We also prove lower bounds for solving Approximate Agreement under all existing Mobile Byzantine fault models.| File | Dimensione | Formato | |
|---|---|---|---|
|
Bonomi_Approximat-Agreement_2018.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
570.49 kB
Formato
Adobe PDF
|
570.49 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
