Validity bound of regular registers with churn and byzantine processes

Authors:
Roberto Baldoni;Silvia Bonomi;Amir Soltani Nezhad
Affiliations:
Università degli Studi di Roma "La Sapienza", Roma, Italy;Università degli Studi di Roma "La Sapienza", Roma, Italy;Università degli Studi di Roma "La Sapienza", Roma, Italy
Venue:
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2011

Citing 5
Cited 2

The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Byzantine quorum systems

Distributed Computing
Dynamic atomic storage without consensus

Proceedings of the 28th ACM symposium on Principles of distributed computing
Implementing a Register in a Dynamic Distributed System

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems

Quorum-based dynamic regular registers in systems with churn

Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
A protocol for implementing byzantine storage in churn-prone distributed systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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).