Academic
Publications
Fault-scalable Byzantine fault-tolerant services

Fault-scalable Byzantine fault-tolerant services,10.1145/1095810.1095817,Operating Systems Review,Michael Abd-El-Malek,Gregory R. Ganger,Garth R. Good

Fault-scalable Byzantine fault-tolerant services   (Citations: 104)
BibTex | RIS | RefWorks Download
A service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. A prototype service built using the Q/U protocol outperforms the same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution. Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%.
Journal: Operating Systems Review - SIGOPS , vol. 39, no. 5, pp. 59-74, 2005
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...It is hard, however, to support critical services that need to remain correct with higher numbers of compromised replicas or to use some Byzantine fault-tolerant algorithms that trade performance by extra replicas (e.g., [6], [8])...

    Miguel Garciaet al. OS diversity for intrusion tolerance: Myth or reality?

    • ...In this paper, we employ the Byzantine failure model, which is the most general and widely accepted threat model [15], [19], [21], [23] that has been applied to numerous distributed systems [1], [3], [19]...
    • ...Both of these measures are functions of the average reliability r ∈ [0, 1] of the node pool; r can be defined as the fraction of time a job returns the correct response...

    Yuriy Brunet al. Smart Redundancy for Distributed Computation

    • ...Finally, we also demonstrated the use of A2M with A2M-Storage, a single-server storage service like SUNDR [54], and A2M-Q/U, an A2M-enabled quorum-based replicated state machine protocol based on Q/U [17], in both cases increasing fault tolerance and/or decreasing the replication factor...

    Petros Maniatiset al. Small trusted primitives for dependable systems

    • ...Byzantine quorum systems [23], [24], [25], [26] can also be used for replication...
    • ...The Q/U protocol [25] of Abd-El-Malek et al. requires 5f + 1 replicas for this purpose and suffers performance degradation when write contention occurs...

    Yair Amiret al. Prime: Byzantine Replication under Attack

    • ...Passive replication: primary-secondary processing: Here, one of the replicas is designated as the primary server that handles a client query, while the other replicas act as standbys [15], [16]...

    Kaliappa Ravindran. Probabilistic Fault-tolerance of Distributed Services: A Paradigm for ...

Sort by: