Downloads: 106
Research Paper | Computer Science & Engineering | India | Volume 3 Issue 3, March 2014
Byzantine Fault Tolerance in Large Scale Reliable Storage System
Dhiraj M. Bochare | A. S. Alvi [3]
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
Edition: Volume 3 Issue 3, March 2014,
Pages: 845 - 848
Similar Articles with Keyword 'Distributed system'
Downloads: 1 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Analysis Study Research Paper, Computer Science & Engineering, India, Volume 8 Issue 12, December 2019
Pages: 2057 - 2069Building Data Replication System Replication System IPFS Nodes Cluster
Downloads: 2 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Survey Paper, Computer Science & Engineering, United States of America, Volume 13 Issue 4, April 2024
Pages: 1730 - 1734A Comparative Analysis of Popular Distributed Key-Value Stores
Ramprasad Chinthekindi [2] | Shyam Burkule [2] | Ashok Kumar Chintakindi