miguel pupo correia
MinBFT, MinZyzzyva, Spinning, EBAWA
MinBFT, MinZyzzyva, Spinning and EBAWA are four Byzantine fault-tolerant state machine replication algorithms implemented by Giuliana Santos Veronese in her PhD work, advised by myself and Lau Cheuk Lung. Alysson Bessani was also much involved in the project. This was was partially funded by the EC under project CRUTIAL - CRitical UTility InfrastructurAL Resilience.
EBAWA is the most important of the four: our BFT replication protocol for WANs. MinBFT, MinZyzzyva and EBAWA use a trusted component called USIG to solve Byzantine fault-tolerant state machine replication with only two replicas and one communication step less than other algorithms in the literature. Spinning is based on Castro and Liskov's PBFT, but rotates the primary whenever there is one agreement about a batch of messages.
This source code is provided as-is. It is only prototypes, there is no manual and support is in a best-effort basis. The code is available here:
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, Paulo Verissimo. Minimal Byzantine Fault Tolerance: Algorithm and Evaluation. DI-FCUL TR-2009-15, June 2009. (pdf)
Presents MinBFT, MinZyzzyva and a detailed evaluation of both in LANs and WANs, with comparisons to PBFT. Still in submission.
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung. Spin One’s Wheels? Byzantine Fault Tolerance with a Spinning Primary. In Proceedings of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS). September 2009. (pdf)
Presents Spinning and its evaluation.
Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung. EBAWA: Efficient Byzantine Agreement for Wide-Area Networks. In 12th IEEE International High Assurance Systems Engineering Symposium (HASE). November 2010. (pdf)
Presents EBAWA and an extensive evaluation of its performance, which is compared with the others and PBFT.
Miguel Correia, Giuliana Santos Veronese, Lau Cheuk Lung, Asynchronous Byzantine Consensus with 2f+1 Processes, In Proceedings of the 25th Annual ACM Symposium on Applied Computing, March 2010. (pdf)
A more theoretical paper that shows how the USIG service allows reducing the number of replicas. Presents a methodology to tranform crash fault-tolerant consensus algorithms into Byzantine fault-tolerant consensus algorithms.
Giuliana Santos, Intrusion Tolerance in Large Scale Networks, PhD Thesis, Faculdade de Ciências da Universidade de Lisboa, 2010.
Puts together all the algorithms and evaluations. The whole picture.
home | last update: 02-05-2011