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

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

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

Efficient Peer-to-Peer Belief Propagation

Karl Aberer, Roman Schmidt

In this paper, we will present an efficient approach for distributed inference. We use belief propagation's message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistrib ...

2006

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

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price charged by the cellular network operators is too high. In this paper, we explain that ther ...

2004

SOWER: Self-Organizing Wireless Network for Messaging

Jean-Pierre Hubaux, Mark Felegyhazi, Srdan Capkun

Short Message Service (SMS) has become extremely popular in many countries, and represents a multi-billion dollars market. Yet many consumers consider that the price cellular network operators charge for it is too high. In this paper, we explain that there ...

2004

Evaluation of a Routing Architecture for Wireless Messaging Ad-Hoc Networks

Mark Felegyhazi, Megha Goel

The Short Messaging Service(SMS) which has become very popular in cellular networks is very highly priced. We show in this paper how self-organizing ad-hoc networks can be used to provide the short messaging service, at a much lower price. We propose a rou ...

2004

Data-Aware Multicast

Rachid Guerraoui, Patrick Eugster

This paper presents a multicast algorithm for peer-to-peer dissemination of events in a distributed topic-based publish-subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribe ...

2004

Data-Aware Multicast

Rachid Guerraoui, Patrick Eugster

2003

Universal multimedia access from wired and wireless systems

Touradj Ebrahimi, Yousri Abdeljaoued

Personal computing and communication devices such as computers, personal digital assistants (PDAs), and mobile phones are moving to their next generation in which the end user will be able to access a multitude of information with a single device either lo ...

2001