Dynamic Byzantine Quorum Systems
نویسندگان
چکیده
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation, however, is their dependence on a static threshold limit on the number of server faults. The correctness of the system is only guaranteed if at all times the threshold is higher than the actual number of faults, yet a conservatively chosen (high) threshold wastes expensive replication in the common situation where the number of faults averages well below the worst case. In this paper we present protocols for dynamically raising and lowering the resilience threshold of a quorumbased Byzantine fault-tolerant data service in response to current information on the number of server failures. Using such protocols, a system can operate in an efficient lowthreshold mode with relatively small quorums in the absence of faults, increasing and decreasing the quorum size (and thus the tolerance) as faults appear and are dealt with,
منابع مشابه
Literature Survey Report On Quorum Systems
This report summarizes the state of the art in the research area of quorum systems as represented by the papers [PM01], [ES00], [MRW97], and [AMR+00]. Quorum systems are used in fault tolerant distributed computing systems for ensuring the availability of a replicated service and replicated data, even if the replicated servers fail by crashing benignly or in a byzantine, i.e. arbitrary way. Quo...
متن کاملOptimal Byzantine Quorum
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers, and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b + 1 servers, have been proposed to construct replicated services tolerant of b arbitrary (Byzantine) server failures. In...
متن کاملProbabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this ...
متن کاملThe Load and Availability of Byzantine Quorum
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two quorums to intersect. Recently, b-masking quorum systems, whose intersections contain at least 2b+1 servers, have been proposed to construct replicated services tolerant of b-arbitrary (Byzantine) server failures. In th...
متن کاملSelected Results from the Latest Decade of Quorum Systems Research
Over the past decade, work on quorum systems in non-traditional scenarios has facilitated a number of advances in the field of distributed systems. This chapter surveys a selection of these results including: Byzantine quorum systems that are suitable for use when parts of the system cannot be trusted; algorithms for the deployment of quorum systems on wide area networks so as to allow for effi...
متن کامل