TY - GEN
T1 - PeerReview
T2 - SOSP'07: 21st ACM Symposium on Operating Systems Principles
AU - Haeberlen, Andreas
AU - Kouznetsov, Petr
AU - Druschel, Peter
PY - 2007/12/1
Y1 - 2007/12/1
N2 - We describe PeerReview, a system that provides accountability in distributed systems. PeerReview ensures that Byzantine faults whose effects are observed by a correct node are eventually detected and irrefutably linked to a faulty node. At the same time, PeerReview ensures that a correct node can always defend itself against false accusations. These guarantees are particularly important for systems that span multiple administrative domains, which may not trust each other.PeerReview works by maintaining a secure record of the messages sent and received by each node. The record isused to automatically detect when a node's behavior deviates from that of a given reference implementation, thus exposing faulty nodes. PeerReview is widely applicable: it only requires that a correct node's actions are deterministic, that nodes can sign messages, and that each node is periodically checked by a correct node. We demonstrate that PeerReview is practical by applying it to three different types of distributed systems: a network filesystem, a peer-to-peer system, and an overlay multicast system.
AB - We describe PeerReview, a system that provides accountability in distributed systems. PeerReview ensures that Byzantine faults whose effects are observed by a correct node are eventually detected and irrefutably linked to a faulty node. At the same time, PeerReview ensures that a correct node can always defend itself against false accusations. These guarantees are particularly important for systems that span multiple administrative domains, which may not trust each other.PeerReview works by maintaining a secure record of the messages sent and received by each node. The record isused to automatically detect when a node's behavior deviates from that of a given reference implementation, thus exposing faulty nodes. PeerReview is widely applicable: it only requires that a correct node's actions are deterministic, that nodes can sign messages, and that each node is periodically checked by a correct node. We demonstrate that PeerReview is practical by applying it to three different types of distributed systems: a network filesystem, a peer-to-peer system, and an overlay multicast system.
KW - Accountability
KW - Byzantine faults
KW - Distributed systems
KW - Fault detection
UR - https://www.scopus.com/pages/publications/41149164678
U2 - 10.1145/1294261.1294279
DO - 10.1145/1294261.1294279
M3 - Conference contribution
AN - SCOPUS:41149164678
SN - 9781595935915
T3 - Operating Systems Review (ACM)
SP - 175
EP - 188
BT - SOSP'07
Y2 - 14 October 2007 through 17 October 2007
ER -