Byzantine fault-tolerant (BFT) state-machine replication makes it possible to design systems
that are resilient against arbitrary faults, a requirement considered crucial for an increasing …

Distributed Systems Page 1 DS 2006; Ch1 16-Jan-06 Timo Alanko, 2006 1 Distributed
Systems Spring 2006 Timo Alanko 16-Jan-06 2 Sources of material • Tanenbaum, van …

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 …

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for
designing and reconfiguring generalized replicated state machines that are, unlike …

This is the third edition of “Distributed Systems.” In many ways, it is a huge difference
compared to the previous editions, the most important one perhaps being that we have fully …

With the advent of trusted execution environments provided by recent general purpose
processors, a class of replication protocols has become more attractive than ever: Protocols …

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about
20,000 lines of challenging C++ code encompassing synchronization, networking and …

RFC 4981: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods [RFC
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …

We consider the problem of making apps fault-tolerant through replication, when apps
operate at the microsecond scale, as in finance, embedded computing, and microservices …

The specific order of commands agreed upon when running state machine replication
(SMR) is immaterial to fault-tolerance: all that is required is for all correct deterministic …