Publication

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Publications associées (303)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Eviction of Misbehaving and Faulty Nodes in Vehicular Networks

Jean-Pierre Hubaux, Imad Aad, Panagiotis Papadimitratos, Maxime Raya, Daniel Jungels

Vehicular Networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to ...

2007

Diffusion Least-Mean Squares Over Adaptive Networks

Ali H. Sayed

Distributed adaptive algorithms are proposed to address the problem of estimation in distributed networks. We extend recent work by relying on static and adaptive diffusion strategies. The resulting adaptive networks are robust to node and link failures an ...

IEEE2007

Collective search of a single odour source using cooperation

Alexandre Herrmann

We study coordination strategies for a multirobot team. The goal is to find the source of an odour most efficiently in terms of the distance travelled by the robots and the time required to discover the source. We focus on the problem of finding the source ...

2007

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

Transformations in distributed computations and applications to set agreement

Bastian Pochon

In a distributed application, high-availability of a critical online service is ensured despite failures by duplicating the vital components of the server. Whilst guaranteeing the access to the server at all times, duplication requires particular care, so ...

EPFL2006

Distributed Consensus, Revisited

Rachele Fuzzati, Massimo Merro

We provide a novel model to formalize a well-known algorithm, by Chandra and Toueg, that solves Consensus among asynchronous distributed processes in the presence of a particular class of failure detectors (Diamond S or, equivalently, Omega), under the hyp ...

2006

VLSI implementation of the list sphere algorithm

Andreas Peter Burg, Matthieu Philippe Emmanuel Zellweger, Christoph Studer

Sphere decoding (SD) is widely considered as one of the most promising detection schemes for multiple-input multiple-output (MIMO) communication systems. The recently proposed list sphere-decoding (LSD) algorithm is an extension of the original SD algorith ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

Model Checking of Consensus Algorithms

André Schiper

We show for the first time that standard model checking allows one to completely verify asynchronous algorithms for solving consensus, a fundamental problem in fault-tolerant distributed computing. Model checking is a powerful verification methodology base ...

2006