Concept

Problème du consensus

Publications associées (257)

Poster: LocalCoin: An Ad-hoc Payment Scheme for Areas with High Connectivity

Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos

The popularity of digital currencies, especially cryptocurrencies, has been continuously growing since the appearance of Bitcoin. Bitcoin is a peer-to-peer (P2P) cryptocurrency protocol enabling transactions between individuals without the need of a truste ...

Assoc Computing Machinery2016

LocalCoin: An ad-hoc payment scheme for areas with high connectivity: poster.

Boi Faltings, Sujit Prakash Gujar, Dimitrios Chatzopoulos

ACM2016

Consensus algorithms and plug-and-play control for current sharing in DC microgrids

Giancarlo Ferrari Trecate

In this paper, we propose a secondary consensus-based control layer for current sharing and voltage balancing in DC microGrids (mGs). Differently from existing approaches based on droop control, we assume decentralized Plug-and-Play (PnP) controllers at th ...

2016

Riffle: An Efficient Communication System With Strong Anonymity

Bryan Alexander Ford, David Lazar

Existing anonymity systems sacrifice anonymity for efficient communication or vice-versa. Onion-routing achieves low latency, high bandwidth, and scalable anonymous communication, but is susceptible to traffic analysis attacks. Designs based on DC-Nets, on ...

2016

Towards 3-D Distributed Odor Source Localization: An Extended Graph-Based Formation Control Algorithm for Plume Tracking

Alcherio Martinoli, Ali Marjovi, Jorge Miguel Dias Almeida Rodrigues Soares, Jonathan Giezendanner, Anil Augustin Kodiyan, António Pedro Rodrigues de Aguiar

The large number of potential applications for robotic odor source localization has motivated the development of a variety of plume tracking algorithms, the majority of which work in restricted two-dimensional scenarios. In this paper, we introduce a distr ...

IEEE2016

Graph-Based Distributed Control for Adaptive Multi-Robot Patrolling through Local Formation Transformation

Alcherio Martinoli, José Nuno Ferreira Maia Pereira, Rodrigo Martins de Matos Ventura

Multi-robot cooperative navigation in real-world environments is essential in many applications, including surveillance and search-and-rescue missions. State-of-the-art methods for cooperative navigation are often tested in ideal laboratory conditions and ...

Ieee2016

Beyond One Third Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Cheng Wang

The Byzantine agreement problem requires a set of

n

processes to agree on a value sent by a transmitter, despite a subset of

b

processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It ...

2015

Safety-Liveness Exclusion in Distributed Computing

Rachid Guerraoui, Victor Bushkov

The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an a ...

ACM Press2015

Safety-Liveness Exclusion in Distributed Computing

Rachid Guerraoui, Victor Bushkov

ACM2015

Making BFT Protocols Really Adaptive

Rachid Guerraoui

Many state-machine Byzantine Fault Tolerant (BFT) protocols have been introduced so far. Each protocol addressed a different subset of conditions and use-cases. However, if the underlying conditions of a service span different subsets, choosing a single pr ...

IEEE2015

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