Concept

Messagerie texte

Publications associées (123)

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

Delay and coding in multiple-user communications

Stéphane Musy

In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source cod ...

EPFL2007

A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks

François Ingelrest

We present a turnover based adaptive HELLO protocol (TAP), which enables nodes in mobile networks to dynamically adjust their HELLO messages frequency depending on the current speed of nodes. To the best of our knowledge, all existing solutions are based o ...

2007

Implementing Belief Propagation on P-Grid

Nicolas Bonvin, Damien Auroux, Grégoire Montavon

Some applications require to solve a Bayesian network in a distributed fashion. It can lead to a large amount of messages exchanged between hosts if the variables of the Bayesian network are not allocated to good hosts. The technique we implement uses an a ...

2007

On the Message Complexity of Indulgent Consensus

Rachid Guerraoui, Seth Gilbert

Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...

Springer2007

On Collision-fast Atomic Broadcast

Rodrigo Malta Schmidt, Fernando Pedone

Atomic Broadcast, an important abstraction in dependable distributed computing, is usually implemented by many instances of the well-known consensus problem. Some asynchronous consensus algorithms achieve the optimal latency of two (message) steps but cann ...

2007

Solving Atomic Broadcast with Indirect Consensus

André Schiper, Nils Richard Ekwall

In previous work, it has been shown how to solve atomic broadcast by reduction to consensus on messages. While this solution is theoretically correct, it has its limitations in practice, since executing consensus on large messages can quickly saturate the ...

2006

Solving Atomic Broadcast with Indirect Consensus

André Schiper, Nils Richard Ekwall

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

Three topics in parallel communications

Emin Gabrielyan

The main objectives pursued by parallelism in communications are network capacity enhancement and fault-tolerance. Efficiently enhancing the capacity of a network by parallel communications is a non-trivial task. Some applications may also allow one to spl ...

EPFL2006

SEVECOM - Secure Vehicle Communication

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Maxime Raya, Levente Buttyan

Vehicle to Vehicle communication (V2V) and Vehicle to Infrastructure communication (V2I) promise to improve road safety and optimize road traffic through cooperative systems applications. A prerequisite for the successful deployment of vehicular communicat ...

2006