Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Classic Paxos vs. fast Paxos: caveat emptor
HotDep'07 Proceedings of the 3rd workshop on on Hot Topics in System Dependability
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Dr. multicast: Rx for data center communication scalability
Proceedings of the 5th European conference on Computer systems
Proceedings of the 5th European conference on Computer systems
The byzantine empire in the intercloud
ACM SIGACT News
Trustworthy clouds underpinning the future internet
The future internet
Hi-index | 0.00 |
Byzantine fault tolerant (BFT) protocols are replication-based solutions to the problem of tolerating the arbitrary failures of software and hardware components. The essential assumption for replication is independence of failures. In this paper, we categorize four different failure independence levels that could be obtained from the cloud. Not surprisingly, providing more level of independence comes with the cost of more delays and less bandwidth. We report on our experiments to identifying the most appropriate BFT protocol for each level.