Dynamic Distributed Computing with Byzantine Failures
نویسنده
چکیده
Byzantine failure tolerance (BFT) is one of the most fundamental problem in distributed computing and has been researched extensively. However, due to the famous impossible result of FLP, there is no perfect way to solve it. Modern BFT protocols are usually proposed with practical assumptions such as partially synchrony, encrypted messages. Yet, designing dynamic BFT system with large number of nodes remains challenge. In this write-up, we will explore and review the techniques in the core of modern BFT protocols, and discuss the recent new approach by combining clustering and random walk to obtain reliable and efficient dynamic BFT system.
منابع مشابه
Byzantine Failure Detection for Dynamic Distributed Systems
Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance. However, as far as we know, there is no general solution for this problem in a dynamic distributed system over wireless networks with unknown membership. This paper presents thus a rst Byzantine failure detector for this context. The protocol has the interesting feature to be time-free, that i...
متن کاملA Proposal to investigate the use of error correcting code techniques in implementing distributed systems resistant to Byzantine failures and security breaches
Throughout the literature on reliable distributed systems there is much coverage of systems which maintain correct operations in the face of fail-stop or non-Byzantine failures. What are less represented are methods for dealing with the harder problem of Byzantine failures. This paper proposes a method for dealing with these sort of failures. Fail-stop or non-Byzantine failures typically are ch...
متن کاملBuilding distributed computing abstractions in the presence of mobile byzantine failures. (Construction d'abstraction informatique distribuée en présence de fautes Bizantines mobiles)
متن کامل
Abstracting out Byzantine Behavior
ing out Byzantine Behavior Peter Druschel, Andreas Haeberlen, Petr Kouznetsov Max Planck Institute for Software Systems MPI-SWS, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany {druschel,ahae,pkouznet}@mpi-sws.mpg.de Abstract. Many distributed systems are designed to tolerate the presence of Byzantine failures: an individual process may arbitrarily deviate Many distributed systems are designe...
متن کاملByzantine Fault Tolerant Execution of Long-running Distributed Applications
Long-running distributed applications that automate critical decision processes require Byzantine fault tolerance to ensure progress in spite of arbitrary failures. Existing replication protocols for data servers guarantee that externally requested operations execute correctly even if a bounded number of replicas fail arbitrarily. However, since these protocols only support passive state machin...
متن کامل