Browse wiki

From Navigators

Jump to: navigation, search
Abstract Most Byzantine fault-tolerant state machin Most Byzantine fault-tolerant state machine replication (BFT) algorithms have a primary replica that is in charge of ordering the clients requests. Recently it was shown that this dependence allows a faulty primary to degrade the performance of the system to a small fraction of what the environment allows. In this paper we present Spinning, a novel BFT algorithm that mitigates such performance attacks by changing the primary after every batch of pending requests is accepted for execution. This novel mode of operation deals with those attacks at a much lower cost than previous solutions, maintaining a throughput equal or better to the algorithm that is usually consider to be the baseline in the area, Castro and Liskov’s PBFT. ine in the area, Castro and Liskov’s PBFT.
Author Giuliana Santos Veronese + , Miguel Correia + , Alysson Bessani + , Lau Cheuk Lung +
Booktitle Proceedings of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS'09). Niagara Falls, USA.  +
Key Spinning09  +
Month sep  +
NumPubDate 2,009.09  +
ResearchLine Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
Title Spin One’s Wheels? Byzantine Fault Tolerance with a Spinning Primary  +
Type inproceedings  +
Url  +
Year 2009  +
Categories Publication  +
Modification dateThis property is a special property in this wiki. 14 January 2013 14:41:01  +
hide properties that link here 
  No properties link to this page.


Enter the name of the page to start browsing from.
Personal tools
Navigators toolbox