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 ...

Distributed systems are everywhere. As everyday lives become more and more dependent on distributed systems, they are expected to withstand different kinds of failures. Different models of failures exist which aim at modeling network errors, hardware failures, soft errors, etc. This thesis concentrates on dealing with a combination of two different kinds of fault tolerance. The Byzantine failur...

This article demonstrates how an expanding population of artists in the seventeenth-century Dutch Republic was connected artistically, and such connections were translated into artistic innovations that fuelled rapid flourishing arts art market. It does so by conceptualising visualising art-historical network iconography that, for first time, connects not through social relations but shared sub...

This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all loyal generals agree on a good plan proposed by a loyal general, and never on a bad plan.

We illustrate in this paper a compositional and stepwise method for designing programs that ooer a potentially unique tolerance to each of their fault-classes. More speciically, our illustration is a design of a repetitive agreement program that ooers two tolerances: (a) it masks the eeects of Byzantine failures and (b) it is stabilizing in the presence of transient and Byzantine failures.

We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f + 1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimens...