Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
Introduction to a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A new fault-tolerant algorithm for clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
Adding time to synchronous process communications
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Tolerating byzantine faults in transaction processing systems using commit barrier scheduling
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Computer Standards & Interfaces
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
Achieving high efficient agreement with malicious faulty nodes on a cloud computing environment
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Computers and Electrical Engineering
Byzantium: Byzantine-fault-tolerant database replication providing snapshot isolation
HotDep'08 Proceedings of the Fourth conference on Hot topics in system dependability
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
Augustus: scalable and robust storage for cloud applications
Proceedings of the 8th ACM European Conference on Computer Systems
| Hi-index | 0.00 |
In this paper we study when and how B Byzantine agreement protocol can he used in general-purpose database management systems. We present an overview of the failure model used for Byzantine agreement, and of the protocol itself. We then present correctness criteria for database processing in this failure environment and discuss strategies for satisfying them. In doing this, we present new failure models for input/output nodes and study ways to distribute input transactions to processing nodes under these models. Finally, we investigate applications of Byzantine agreement protocols in the more common failure environment where processors are assumed to halt after a failure.