BAR fault tolerance for cooperative services

By Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement, M. Dahlin, Jean-Philippe Martin, C. Porth. Symposium on Operating Systems Principles, 2005

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Zyzzyva (2007, methodology): “Journal of the ACM, 32(2):374–382, april 1985.”
Efficient Byzantine Fault-Tolerance (2013, methodology): “These algorithms have already been used to design intrusiontolerant services such as network file systems [12], [14], [49], cooperative backup [3], large scale storage [2], DNS [11], coordination services [8], [14], certification authorities [50], databases [21], and key management systems [40].”
Making Byzantine Fault Tolerant Systems Tolerate Byzantine Faults (2009, neutral): “The primary is thus in a unique position to control both overall system progress [3, 4] and fairness to individual clients.”
Attested append-only memory: making adversaries stick to their word (2007, background): “BAR [7] fault tolerance contains a notion of protocol-action commitment (to a quorum maintained by replicas themselves) to capture rational behavior.”
SoK: Consensus in the Age of Blockchains (2017, methodology): “phy [19, 43] and the BAR model [3] could be adapted to work here.”