Concept

Multimedia Messaging Service

Publications associées (58)

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

On the Age of Pseudonyms in Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Julien Freudiger

In many envisioned mobile ad hoc networks, nodes are expected to periodically beacon to advertise their presence. In this way, they can receive messages addressed to them or participate in routing operations. Yet, these beacons leak information about the n ...

2010

One Acceptor is Enough

Rachid Guerraoui, Maysam Yabandeh

The celebrated Paxos protocol implements a reliable service as a state machine replicated over several machines. Replication provides reliability against permanent failures and availability against temporary crash failures. Whereas, in theory, Paxos can to ...

2010

PaxosInside

Rachid Guerraoui, Maysam Yabandeh

Amodernmanycore architecture can be viewed as a distributed system with explicit message passing to communicate between cores. Ensuring the consistency of shared state replicated over several cores is the key to the well functioning of such a system. Yet, ...

2010

Interference Alignment at Finite SNR: General Message Sets

Michael Christoph Gastpar

Interference alignment has proven to be a powerful tool in characterizing the high SNR behavior of wireless networks. Using this technique, Cadambe and Jafar showed that the sum degrees-of-freedom for the K-user interference channel is K/2 rather than 1 as ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

A Multimedia Terminal Supporting Adaptation for QoS Control

Marco Mattavelli, Daniele Renzi, Beilu Shao

This paper addresses the End-to-End Quality of Service (QoS) guarantees and control for multimedia content delivery over heterogeneous networks, with a particular focus on end user terminal perspective. We design and implement a multimedia terminal which c ...

IEEE Computer Society2008

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

, ,

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

JPWL - an Extension of JPEG 2000 for Wireless Imaging

In this paper, we present an overview of the JPWL standardization activity. JPWL is an extension of JPEG 2000 for the efficient transmission of JPEG 2000 images over an error-prone wireless network. More specifically, JPWL supports a set of tools for error ...

IEEE2006

Method to Filter Electronic Messages in A Message Processing System

Jean-Yves Le Boudec, Slavisa Sarafijanovic

The present invention proposes a method to filter electronic messages in a message processing system, this message processing system comprising a temporary memory for storing the received messages intended to users, a first database dedicated to a specific ...

2006

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