This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.
Approximate Agreement under Mobile Byzantine Faults / Bonomi, Silvia; DEL POZZO, Antonella; Potop Butucaru, Maria; Tixeuil, Sebastien. - ELETTRONICO. - (2016), pp. 727-728. (Intervento presentato al convegno 36th IEEE International Conference on Distributed Computing Systems, ICDCS 2016 tenutosi a Nara; Japan) [10.1109/ICDCS.2016.68].
Approximate Agreement under Mobile Byzantine Faults
BONOMI, Silvia
;DEL POZZO, ANTONELLA
;
2016
Abstract
This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.| File | Dimensione | Formato | |
|---|---|---|---|
|
Bonomi_Approximate-Agreement_2016.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
122.77 kB
Formato
Adobe PDF
|
122.77 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
