A protocol for implementing byzantine storage in churn-prone distributed systems

Distributed storage service is one of the main abstractions provided to the developers of distributed applications due to its capability to hide the complexity generated by the messages exchanged between processes. Many protocols have been proposed to build byzantine-fault-tolerant storage services on top of a message-passing system, but they do not consider the possibility to have servers joining and leaving the computation (churn phenomenon). This phenomenon, if not properly mastered, can either block protocols or violate the safety of the storage. In this paper, we address the problem of building a safe register storage resilient to byzantine failures in a distributed system affected from churn. A protocol implementing a safe register in an eventually synchronous system is proposed and some feasibility constraints on the arrival and departure of the processes are given. The protocol is proved to be correct under the assumption that the constraint on the churn is satisfied.

[1]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 1998, Distributed Computing.

[2]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[3]  Roberto Baldoni,et al.  Validity bound of regular registers with churn and byzantine processes , 2011, PODC '11.

[4]  Vincent Gramoli,et al.  Reconfigurable Distributed Storage for Dynamic Networks , 2005, OPODIS.

[5]  Nancy A. Lynch,et al.  RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks , 2002, DISC.

[6]  Rida A. Bazzi.  Synchronous Byzantine quorum systems , 1997, PODC '97.

[7]  Fred B. Schneider,et al.  Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.

[8]  Michael K. Reiter,et al.  Byzantine quorum systems , 1997, STOC '97.

[9]  Michael Merritt,et al.  Computing with Infinitely Many Processes , 2000, DISC.

[10]  Anne-Marie Kermarrec,et al.  Implementing a Register in a Dynamic Distributed System , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[11]  Michael Dahlin,et al.  Minimal Byzantine Storage , 2002, DISC.

[12]  Rida A. Bazzi,et al.  Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions , 2007, DISC.

[13]  Marcos K. Aguilera,et al.  Dynamic atomic storage without consensus , 2009, PODC '09.

[14]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[15]  Michel Raynal,et al.  Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn , 2012, IEEE Transactions on Parallel and Distributed Systems.

[16]  Nancy A. Lynch,et al.  Rambo II: rapidly reconfigurable atomic memory for dynamic networks , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[17]  Alec Wolman,et al.  Centrifuge: Integrated Lease Management and Partitioning for Cloud Services , 2010, NSDI.

[18]  Michael Dahlin,et al.  Small byzantine quorum systems , 2002, Proceedings International Conference on Dependable Systems and Networks.