This paper studies the problem of building a byzantine fault tolerant storage service in a distributed system affected by servers join and leave (i.e., servers churn). We show a bound for ensuring both validity of read operations and the persistence of a value written by a write operation. This bound correlates the churn rate, the number of faulty processes and the time taken by register operations (i.e., join, read and write operations). © 2011 Authors.
Validity bound of regular registers with churn and byzantine processes / Baldoni, Roberto; Bonomi, Silvia; Amir Soltani, Nezhad. - STAMPA. - (2011), pp. 225-226. (Intervento presentato al convegno 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC'11, Held as Part of the 5th Federated Computing Research Conference, FCRC tenutosi a San Jose, California, USA nel 6 June 2011 through 8 June 2011) [10.1145/1993806.1993845].
Validity bound of regular registers with churn and byzantine processes
BALDONI, Roberto;BONOMI, Silvia;
2011
Abstract
This paper studies the problem of building a byzantine fault tolerant storage service in a distributed system affected by servers join and leave (i.e., servers churn). We show a bound for ensuring both validity of read operations and the persistence of a value written by a write operation. This bound correlates the churn rate, the number of faulty processes and the time taken by register operations (i.e., join, read and write operations). © 2011 Authors.| File | Dimensione | Formato | |
|---|---|---|---|
|
VE_2011_11573-376788.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
404.47 kB
Formato
Adobe PDF
|
404.47 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
