Abstract
|
State machine replication (SMR) is a gener … State machine replication (SMR) is a generic technique for implementing fault-tolerant distributed services by replicating them in sets of servers. There have been several proposals for using SMR to tolerate arbitrary or Byzantine faults, including intrusions. However, most of these systems can tolerate at most f faulty servers out of a total of 3f + 1. We show that it is possible to implement a Byzantine state machine replication algorithm with only 2f + 1 replicas by extending the system with a simple trusted distributed component. Several performance metrics show that our algorithm, BFT-TO, fares well in comparison with others in the literature. Furthermore, BFT-TO is not vulnerable to some recently-presented performance attacks that affect alternative approaches. ttacks that affect alternative approaches.
|
Author
|
Miguel Correia +
, Nuno Ferreira Neves +
, Paulo Verissimo +
|
Document
|
Document for Publication-BFT-TO.pdf +
|
Journal
|
The Computer Journal +
|
Key
|
BFT-TO +
|
Month
|
jun +
|
NumPubDate
|
2,013.06 +
|
Pages
|
693–715 +
|
Project
|
Project:MASSIF +
, Project:TCLOUDS +
, Project:RC-Clouds +
|
ResearchLine
|
Fault and Intrusion Tolerance in Open Distributed Systems (FIT) +
|
Title
|
BFT-TO: Intrusion Tolerance with +
|
Type
|
article +
|
Volume
|
56 +
|
Year
|
2013 +
|
Has improper value forThis property is a special property in this wiki.
|
Url +
|
Categories |
Publication +
|
Modification dateThis property is a special property in this wiki.
|
19 June 2013 14:21:07 +
|
NumberThis property is a special property in this wiki.
|
6 +
|