Publication

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

Related publications (82)

Graph Chatbot

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.

Byzantine Failures and Security: Arbitrary is not (always) Random

Felix Gaertner

The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyse the effects of very severe hardware faults in aircraft control systems. Lately, the Byzantine failu ...

2003

Revisiting Token-based Atomic Broadcast Algorithms

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last twenty years. The two main mechanisms used to tolerate failures (if we exclude synchronous systems and consider only crash failures) are unreliable failure detectors and group membership. Tok ...

2003

Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements

André Schiper

A. Coccoli, P. Urban, A. Bondavalli, and A. Schiper. Performance analysis of a consensus algorithm combining Stochastic Activity Networks and measurements. In Proc. Int'l Conf. on Dependable Systems and Networks (DSN), pages 551-560, Washington, DC, USA, J ...

2002

Fault-tolerant and transactional mobile agent execution

Stefan Pleisch

Mobile agents constitute a computing paradigm of a more general nature than the widely used client/server computing paradigm. A mobile agent is essentially a computer program that acts autonomously on behalf of a user and travels through a network of heter ...

EPFL2002

Design and Implementation of a Universal Multimedia Access Environment

Touradj Ebrahimi, David Marimon Sanjuan

The objective of Universal Multimedia Access (UMA) is to permit any user equipped with whatever device the access to multimedia information. To handle the problems of UMA, two different approaches are commonly used: store variations of the same content and ...

2002

Probabilistic Atomic Broadcast

Fernando Pedone, Pascal Felber

Reliable distributed protocols, such as consensus and atomic broadcast, are known to scale poorly with large number of processes. Recent research has shown that algorithms providing probabilistic guarantees are a promising alternative for such environments ...

2002

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Peter Urban, Xavier Defago and Andre Schiper: Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be? Keywords: replication, atomic broadcast, consensus, measurements, robustness, high load, LAN, FLP impossibility Abstra ...

2001

Optimistic Active Replication

André Schiper, Pascal Felber

Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, ...

IEEE Computer Society2001

Optimistic active replication

André Schiper

IEEE Comput. Soc2001

Asynchronous Leasing

Rachid Guerraoui, Partha Dutta, Romain Boichat

Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion of time and was hence strongly tied to synchronous system ...

2001