Efficient Consistency for Erasure-Coded Data via Versioning Servers

Abstract

We thank the members and companies of the PDL Consortium (including EMC, Hewlett-Packard, Hitachi, IBM, Intel, Microsoft, Network Appliance, Oracle, Panasas, Seagate, Sun, and Veritas) for their interest, insights, feedback, and support. We thank IBM and Intel for hardware grants supporting our research efforts.

A framework for dynamic Byzantine storage

“…We present a methodology that easily transforms several existing Byzantine protocols for static quorum systems [9,13,14,17,18] into corresponding protocols that operate correctly when the administrator is allowed to add or remove servers from the quorum system, as well as to change its resilience threshold. Performing the transformation does not require extensive changes to the protocols: all that is required is to replace calls to the Q-RPC primitive used in static protocols with calls to DQ-RPC, a new primitive that in the static case behaves like Q-RPC but can handle operations across quorums that…”

“…They guarantee atomic semantics in an unreliable asynchronous network despite crash failures. name can tolerate (crash,Byz) client failures semantics servers required crash (f, 0), without signatures crash atomic 2f + 1 U-dissemination [17] (0, b), using signatures crash atomic 3b + 1 hybrid-d [9] (f, b), using signatures crash atomic 2f + 3b + 1 U-masking [18] (0, b), without signatures correct partial-atomic 4 4b + 1 hybrid-m [9] (f, b), without signatures correct partial-atomic 4 2f + 4b + 1 Phalanx [14] (0, b), without client signatures Byzantine partial-atomic 4 4b + 1 hybrid Phalanx (f, b), without client signatures Byzantine partial-atomic 4 2f + 4b + 1 Figure 1: List of quorum protocols that can be made dynamic using DQ-RPC…”

“…In this paper we propose a methodology for transforming static Byzantine quorum protocols into dynamic ones where both N and f can change, growing and shrinking as appropriate 3 during the life of the system. We have successfully applied our methodology to several Byzantine quorum protocols [9,13,14,17,18]. The common characteristic of these protocols is that they are based on the Q-RPC primitive [13].…”

PASIS: A Distributed Framework for Perpetually Available and Secure Information Systems

“…We have demonstrated instances across a wide range of data encoding schemes, numbers of failures, etc. [Wylie03a,Wylie03b,Goodson03b,Goodson03c]. 2…”

Fab

“…FarSite [1] is a distributed serverless file system that uses voting-based algorithms to tolerate Byzantine failures. Self-* is also a serverless file system that uses quorum-based erasure-coding algorithms [12,16]. Figure 1: The structure of a FAB system.…”