Downloads: 117
Research Paper | Computer Science Engineering | Volume 3 Issue 3, March 2014 | Pages: 845 - 848 | India
Byzantine Fault Tolerance in Large Scale Reliable Storage System
Abstract: Byzantine-fault-tolerant replication enhances the availability and reliability of Internet services that store critical state and preserve it despite attacks and software errors. Existing Byzantine-fault-tolerant storage systems assume a static set of replicas, and have restrictions in how they handle reconfigurations. This paper describes a new replication algorithm with PBFT operation that are able to tolerate Byzantine faults. Byzantine fault- tolerant algorithms will be important because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit illogical behavior. BFT state machine replication protocols are quite fast, they dont tolerate Byzantine faults very well. Byzantine faults occur as a result of software errors and malicious attacks.
Keywords: Byzantine Fault Tolerance, Distributed system, Membership Service, Replica, Liveness
How to Cite?: Dhiraj M. Bochare, A. S. Alvi, "Byzantine Fault Tolerance in Large Scale Reliable Storage System", Volume 3 Issue 3, March 2014, International Journal of Science and Research (IJSR), Pages: 845-848, https://www.ijsr.net/getabstract.php?paperid=20131330, DOI: https://dx.doi.org/10.21275/20131330