Conference paper Open Access

XFT: Practical Fault Tolerance Beyond Crashes

Liu, Shengyun; Viotti, Paolo; Chachin, Christian; Quéma, Vivien; Vukolic, Marko

Despite years of intensive research, Byzantine faulttolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash fault-tolerance (CFT). This overhead of BFT comes from the assumption of a powerful adversary that can fully control not only the Byzantine faulty machines, but at the same time also the message delivery schedule across the entire network, effectively inducing communication asynchrony and partitioning otherwise correct machines at will. To many practitioners, however, such strong attacks appear irrelevant. In this paper, we introduce cross fault tolerance or XFT, a novel approach to building reliable and secure distributed systems and apply it to the classical state-machine replication (SMR) problem. In short, an XFT SMR protocol provides the reliability guarantees of widely used asynchronous CFT SMR protocols such as Paxos and Raft, but also tolerates Byzantine faults in combination with network asynchrony, as long as a majority of replicas are correct and communicate synchronously. This allows the development of XFT systems at the price of CFT (already paid for in practice), yet with strictly stronger resilience than CFT — sometimes even stronger than BFT itself. As a showcase for XFT, we present XPaxos, the first XFT SMR protocol. Although it offers much stronger resilience than CFT SMR at no extra resource cost, the performance of XPaxos matches that of the state-of-the art CFT protocols.

Files (374.9 kB)
Name Size
XFT-Practical-Fault-Tolerance-Beyond-Crashes.pdf
md5:e7d2719e3c74fd8855cc2b9c02ee7030
374.9 kB Download
27
21
views
downloads
All versions This version
Views 2727
Downloads 2121
Data volume 7.9 MB7.9 MB
Unique views 2727
Unique downloads 2121

Share

Cite as