Concept
Distributed hash table
Related publications (271)
Planetary-Scale Byzantine Fault Tolerance
The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...
EPFL2024The Privacy Power of Correlated Noise in Decentralized Learning
Rachid Guerraoui, Martin Jaggi, Anastasiia Koloskova, Youssef Allouah, Aymane El Firdoussi
Decentralized learning is appealing as it enables the scalable usage of large amounts of distributed data and resources (without resorting to any central entity), while promoting privacy since every user minimizes the direct exposure of their data. Yet, wi ...
PMLR2024Building Strongly-Consistent Systems Resilient to Failures, Partitions, and Slowdowns
Distributed systems designers typically strive to improve performance and preserve availability despite failures or attacks; but, when strong consistency is also needed, they encounter fundamental limitations. The bottleneck is in replica coordination, whi ...
EPFL2023Hypergraph-Based Fast Distributed AC Power Flow Optimization
Colin Neil Jones, Yuning Jiang, Yingzhao Lian, Xinliang Dai
This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...
New York2023Reliable Microsecond-Scale Distributed Computing
The landscape of computing is changing, thanks to the advent of modern networking equipment that allows machines to exchange information in as little as one microsecond. Such advancement has enabled microsecond-scale distributed computing, where entire dis ...
EPFL2023As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert
In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023Peer-Prediction in the Presence of Outcome Dependent Lying Incentives
Boi Faltings, Naman Goel, Aris Filos Ratsikas
We derive conditions under which a peer-consistency mechanism can be used to elicit truthful data from non-trusted rational agents when an aggregate statistic of the collected data affects the amount of their incentives to lie. Furthermore, we discuss the ...
2022Oracular Byzantine Reliable Broadcast
Rachid Guerraoui, Manuel José Ribeiro Vidigueira, Martina Camaioni, Matteo Monti
Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022The Universal Gossip Fighter
Rachid Guerraoui, Anne-Marie Kermarrec, Anastasiia Kucherenko, Rafaël Benjamin Pinot
The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...
2022Optimizing the mitigation of epidemic spreading through targeted adoption of contact tracing apps
The ongoing COVID-19 pandemic is the first epidemic in human history in which digital contact tracing has been deployed at a global scale. Tracking and quarantining all the contacts of individuals who test positive for a virus can help slow down an epidemi ...
AMER PHYSICAL SOC2022