We study the problem of privately emulating shared memory in message-passing networks.
The system includes clients that store and retrieve replicated information on N servers, out of …

We study a well-known communication abstraction called Uniform Reliable Broadcast
(URB). URB is central in the design and implementation of fault-tolerant distributed systems …

The multivalued consensus problem is a fundamental issue in fault-tolerant distributed
computing. It encompasses a wide range of agreement problems where processes must …

By introducing programmability, automated verification, and innovative debugging tools,
Software-Defined Networks (SDNs) are poised to meet the increasingly stringent …

Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he
showed that an arbitrary behavior of the failure detector never violates safety requirements …

Abstract Byzantine Fault Tolerant (BFT) replication leverages highly available cloud services
and can facilitate the implementation of distributed ledgers, eg, the blockchain. Systems …

The virtual synchrony abstraction was proven to be extremely useful for asynchronous, large-
scale, message-passing distributed systems. Self-stabilizing systems can automatically …

Replicated state machine is a fundamental concept used for obtaining fault tolerant
distributed computation. Legacy distributed computational architectures (such as Hadoop or …

We consider distributed systems that work in dynamic asynchronous environments, such as
a shared storage system [8]. A configuration, is a set of active processors (servers or …

One of the most celebrated problems of fault-tolerant distributed computing is the consensus
problem. It was shown to abstract a myriad of problems in which processes have to agree on …