Abstract
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 of 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adya, A., Dunagan, J., Wolman, A.: Centrifuge: integrated lease management and partitioning for cloud services. In: Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation, NSDI (2010)
Aguilera, M.K., Keidar, I., Malkhi, D., Shraer, A.: Dynamic atomic storage without consensus. In: Proceedings of 28th Annual ACM Symposium on Principles of Distributed Computing, PODC (2009)
Aguilera, M., Chen, W., Toueg, S.: Failure Detection and Consensus in the Crash-recovery Model. Distributed Computing 13(2), 99–125 (2000)
Aiyer, A.S., Alvisi, L., Bazzi, R.A.: Bounded Wait-Free Implementation of Optimally resilient Byzantine Storage without (Unproven) Cryptographic assumptions. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 7–19. Springer, Heidelberg (2007)
Baldoni, R., Bonomi, S., Kermarrec, A.M., Raynal, M.: Implementing a Register in a Dynamic Distributed System. In: Proceedings of the 29th IEEE International Conference on Distributed Computing Systems, ICDCS (2009)
Baldoni, R., Bonomi, S., Raynal, M.: Implementing a Regular Register in an Eventually Synchronous Distributed System prone to Continuous Churn. In: IEEE Transactions on Parallel and Distributed Systems, TPDS (2011), http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.97
Baldoni, R., Bonomi, S., Soltani Nezhad, A.: Regular Registers in Dynamic Distributed Systems with Byzantine Processes: Bounds and Performance Analysis Technical report - MIDLAB 3/11 - 2011. A short version of this paper will appear in PODC (2011)
Baldoni, R., Bonomi, S., Soltani Nezhad, A.: An Algorithm for implementing BFT Registers in Distributed Systems with Bounded Churn Technical report - MIDLAB 5/11 (2011)
Bazzi, R.A.: Synchronous Byzantine Quorum Systems. Distributed Computing 13(1), 45–52 (2000)
Chockler, G., Gilbert, S., Gramoli, V., Musial, P.M., Shvartsman, A.: Reconfigurable distributed storage for dynamic networks. Journal Parallel Distributed Computing 69(1), 100–116 (2009)
Gilbert, S., Lynch, N., Shvartsman, A.: RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. In: Proceedings of International Conference on Dependable Systems and Networks, DSN (2003)
Haldar, S., Vidyasankar, K.: Constructing 1-writer Multireader Multivalued Atomic Variables from Regular Variables. JACM 42(1), 186–203 (1995)
Lamport, L.: On Interprocess Communication, Part 1: Models, Part 2: Algorirhms. Distributed Computing 1(2), 77–101 (1986)
Lynch, N., Shvartsman, A.: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 173–190. Springer, Heidelberg (2002)
Malkhi, D., Reiter, M.K.: Byzantine Quorum Systems. Distributed Computing 11(4), 203–213 (1998)
Martin, J., Alvisi, L., Dahlin, M.: Minimal Byzantine Storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311–325. Springer, Heidelberg (2002)
Merritt, M., Taubenfeld, G.: Computing with Infinitely Many Processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 164–178. Springer, Heidelberg (2000)
Schneider Fred, B.: Implementing Fault-Tolerant Services Using the State Machine Approach. ACM Computing Surveys 22(4), 299–319 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldoni, R., Bonomi, S., Soltani Nezhad, A. (2011). An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn. In: Défago, X., Petit, F., Villain, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2011. Lecture Notes in Computer Science, vol 6976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24550-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-24550-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24549-7
Online ISBN: 978-3-642-24550-3
eBook Packages: Computer ScienceComputer Science (R0)