Publications associées à The Universal Gossip Fighter

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.

Rethinking General-Purpose Decentralized Computing

Bryan Alexander Ford, Eleftherios Kokoris Kogias, Georgia Fragkouli, Enis Ceyhun Alp

While showing great promise, smart contracts are difficult to program correctly, as they need a deep understanding of cryptography and distributed algorithms, and offer limited functionality, as they have to be deterministic and cannot operate on secret da ...

ASSOC COMPUTING MACHINERY2019

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Pascal Frossard, Sergio Mena, Stefano D'Aronco

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have, however, large requirements in terms of both network and computational resources ...

2017

Distributed rate allocation in switch-based multiparty videoconference

Pascal Frossard, Sergio Mena, Stefano D'Aronco

Multiparty videoconferences, or more generally multiparty video calls, are gaining a lot of popularity as they offer a rich communication experience. These applications have however, large requirements in terms of both network and computational resources a ...

ACM2016

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Finding Trojan Message Vulnerabilities in Distributed Systems

Rachid Guerraoui, George Candea, Radu Banabic

Trojan messages are messages that seem correct to the receiver but cannot be generated by any correct sender. Such messages constitute major vulnerability points of a distributed system---they constitute ideal targets for a malicious actor and facilitate f ...

ACM2014

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Distributed Rate Allocation With Intersession Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, ...

IEEE2012

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

The Universal Gossip Fighter

Graph Chatbot

Chattez avec Graph Search

Rethinking General-Purpose Decentralized Computing

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Distributed rate allocation in switch-based multiparty videoconference

Tight Bounds for Asynchronous Renaming

Finding Trojan Message Vulnerabilities in Distributed Systems

Generating Fast Indulgent Algorithms

Randomized versus Deterministic Implementations of Concurrent Data Structures

Distributed Rate Allocation With Intersession Network Coding

The complexity of robust atomic storage

Rethinking General-Purpose Decentralized Computing

Distributed rate allocation in switch-based multiparty videoconference

Distributed Rate Allocation in Switch-Based Multiparty Videoconferencing System

Distributed Rate Allocation With Intersession Network Coding

Tight Bounds for Asynchronous Renaming

Generating Fast Indulgent Algorithms

Finding Trojan Message Vulnerabilities in Distributed Systems

The complexity of robust atomic storage

Randomized versus Deterministic Implementations of Concurrent Data Structures