Validity bound of regular registers with churn and byzantine processes
Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad · 2011
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.