Publications by André Schiper

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In this paper we propose a novel location management scheme tailored for multicasting in Mobile Ad-hoc Networks (MANETs). We furthermore propose AMDLM, a location-based multicast algorithm relying on the location management service. Such an approach avoids ...

Paxos is probably the most popular state machine replication protocol. Two optimizations that can greatly improve its performance are batching and pipelining. Nevertheless, tuning these two optimizations to achieve high-throughput can be challenging, as th ...

Many atomic broadcast algorithms have been published in the last 20 years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service and none of the ...

We compare the consensus problem with the uniform consensus problem in synchronous systems. In contrast to consensus, uniform consensus is not solvable in synchronous systems with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processes are faulty. We consider this failure model and we examine the number of rounds required to reach a decision in co

Quorum systems (introduced in the late seventies) and atomic broadcast (introduced later) are two techniques to manage replicated data. Despite of the fact that these two techniques are now well known, the advantage of atomic broadcast over quorum systems ...

Atomic broadcast in particular, and group communication in general, have mainly been specified and implemented in a system model where processes do not recover after a crash. The model is called crash-stop. The drawback of this model is its inability to ex ...

Algorithms for solving agreement problems can be classified in two categories: (1) those relying on failure detectors that we call \emph{FD-based}, and (2) those that rely on a Group Membership Service that we call

GMS-based''. The paper discusses the advantages and limitations of these two approaches, and proposes an extension to the GMS-approach that combines the advantages of both approaches, without their drawbacks. This extension leads us to distinguish between

time-triggered'' suspicions of proces

The paper presents and compares Appia and Cactus, two frameworks for protocol composition. The comparison is based on the experience gained in implementing a fault-tolerant Atomic Broadcast service. The paper also gives preliminary performance results, and concludes with a discussion of the most interesting features of the two frameworks, and suggestions for an improved framework.

{\DUPLEX} est un environnement d'édition coopérative pour des utilisateurs connectés sur Internet. La large échelle implique l'hétérogénéité, des délais de communication non bornés et des pannes. Dans ce cadre, les techniques traditionnelles utilisées pour l'édition coopérative dans un réseau local sont inefficaces. {\DUPLEX} propose un modèle basé sur une décomposition du document en parties indépendantes maintenues individuellement par un noyau dupliqué. Le traitement de l'atomicité et du contrôle de dupl

Le consensus vectoriel : une nouvelle spécification du probl&egr

Atomic broadcast is a useful abstraction for implementing fault-tolerant distributed applications such as state-machine replication. Although a number of algorithms solving atomic broadcast have been published, the problem of bounding the memory used by th ...

André Schiper

Chat with Graph Search

Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults

A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks

Stabilization, Safety and Security Preface

Tuning Paxos for high-throughput with batching and pipelining

A Fault-Tolerant Token-Based Atomic Broadcast Algorithm

Uniform Consensus Harder than Consensus

Tolerating Corrupted Communication

Replication: Understanding the Advantage of Atomic Broadcast over Quorum Systems

Brief Announcement: A Leader-free Byzantine Consensus Algorithm

Brief Announcement: A Leader-free Byzantine Consensus Algorithm

A new look at atomic broadcast in the asynchronous crash-recovery model

Time vs. Space in Fault-Tolerant Distributed Systems

An Automatic Real-Time Analysis of the Time to Reach Consensus

Appia vs. Cactus: Comparing Protocol Composition Frameworks

Consensus with Partial Synchrony

Édition Coopérative et Large Échelle dans Duplex

Group Communication: From Practice to Theory

Le consensus vectoriel: une nouvelle spécification du problème du consensus dans un modèle Byzantin

Relaxed Atomic Broadcast: State-Machine Replication Using Bounded Memory

Reducing the Cost for Non-Blocking in Atomic Commitment