Publication

Scalable Monitoring of Interconnected Stochastic Systems

Publications associées (32)

Planetary-Scale Byzantine Fault Tolerance

Matteo Monti

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 ...
EPFL2024

Reliable Microsecond-Scale Distributed Computing

Athanasios Xygkis

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 ...
EPFL2023

Plug-and-Play Fault Detection and Isolation for Large-Scale Nonlinear Systems With Stochastic Uncertainties

Giancarlo Ferrari Trecate

This paper proposes a novel scalable model-based fault detection and isolation approach for the monitoring of nonlinear large-scale systems, consisting of a network of interconnected subsystems. The fault diagnosis architecture is designed to automatically ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Distributed Fault Detection for Interconnected Large-Scale Systems: A Scalable Plug & Play Approach

Giancarlo Ferrari Trecate, Marcello Farina

In this paper, we propose a novel distributed fault detection method to monitor the state of a-possibly large scale-linear system, partitioned into interconnected subsystems. The approach hinges on the definition of a partition-based distributed Luenberger ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Stochastic fault detection in a plug-and-play scenario

Giancarlo Ferrari Trecate

This paper proposes a novel stochastic Fault Detection (FD) approach for the monitoring of Large-Scale Systems (LSSs) in a Plug-and-Play (PnP) dynamic scenario. The proposed architecture considers stochastic bounds on the measurement noises and modeling un ...
2015

The Homeostasis Protocol: Avoiding Transaction Coordination Through Program Analysis

Christoph Koch, Hossein Hojjat

Datastores today rely on distribution and replication to achieve improved performance and fault-tolerance. But correctness of many applications depends on strong consistency properties—something that can impose substantial overheads, since it requires coor ...
ACM Press2015

Implementation of a Distributed Computation Framework

Matej Pavlovic

This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstracti ...
2013

Automated Vulnerability Discovery in Distributed Systems

Rachid Guerraoui, George Candea, Radu Banabic

In this paper we present a technique for automatically assessing the amount of damage a small number of participant nodes can inflict on the overall performance of a large distributed system. We propose a feedback-driven tool that synthesizes malicious node ...
2011

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...
ACM Press2011

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.