An algorithm for implementing BFT registers in distributed systems with bounded churn

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6976 LNCS, Issue , 2011, Pages 32-46

  Baldoni, Roberto ^a   Bonomi, Silvia ^a   Soltani Nezhad, Amir ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Bounded Churn; Byzantine Failures; Eventually Synchronous System; Safe Register

Indexed keywords

BOUNDED CHURN; BYZANTINE FAILURES; DISTRIBUTED APPLICATIONS; DISTRIBUTED STORAGE; DISTRIBUTED SYSTEMS; EVENTUALLY SYNCHRONOUS SYSTEM; MESSAGE PASSING SYSTEMS; SAFE REGISTER; STORAGE SERVICES; SYNCHRONOUS SYSTEM;

FAULT TOLERANT COMPUTER SYSTEMS; MESSAGE PASSING; STABILIZATION;

NETWORK SECURITY;

EID: 80054708252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24550-3_5     Document Type: Conference Paper

References (18)

1. 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)
2. 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)
3. Aguilera, M., Chen, W., Toueg, S.: Failure Detection and Consensus in the Crash-recovery Model. Distributed Computing 13(2), 99-125 (2000)
4. 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)
5. 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)
6. 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
7. 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)
8. 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)
9. Bazzi, R.A.: Synchronous Byzantine Quorum Systems. Distributed Computing 13(1), 45-52 (2000)
10. 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)
11. 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)
12. Haldar, S., Vidyasankar, K.: Constructing 1-writer Multireader Multivalued Atomic Variables from Regular Variables. JACM 42(1), 186-203 (1995)
13. Lamport, L.: On Interprocess Communication, Part 1: Models, Part 2: Algorirhms. Distributed Computing 1(2), 77-101 (1986)
14. 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)
15. Malkhi, D., Reiter, M.K.: Byzantine Quorum Systems. Distributed Computing 11(4), 203-213 (1998)
16. Martin, J., Alvisi, L., Dahlin, M.: Minimal Byzantine Storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311-325. Springer, Heidelberg (2002)
17. 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)
18. Schneider Fred, B.: Implementing Fault-Tolerant Services Using the State Machine Approach. ACM Computing Surveys 22(4), 299-319 (1990)