Concept

Real-time Transport Protocol

Publications associées (116)

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely

We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...

2013

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

We develop a formal framework for the analysis of security protocols in wireless networks. The framework captures characteristics necessary to reason about neighbor discovery protocols, such as the neighbor relation, device location, and message propagatio ...

Ieee Computer Soc2013

Real-time control of the period of individual ELMs by EC power on TCV

Olivier Sauter, Basil Duval, Stefano Coda, Timothy Goodman, Yves Martin, Jean-Marc Moret, Federico Alberto Alfredo Felici, Jonathan Rossel

The period of individual type-I edge-localized modes (ELMs) in TCV H-mode plasmas is controlled by real-time controlled application of electron cyclotron (EC) power close to the plasma pedestal. An ELM pacing algorithm, closely related to sawtooth pacing [ ...

2013

Effects of Age, Sex and Treatment on Weight Loss Dynamics in Overweight People

David Atienza Alonso, Emiliano Luis Rincon Vallejos

The objective of this work is the evaluation of how sex, age and the kind of followed treatment affect weight loss, as well as the development of an explanation to assess the evolution of weight loss dynamics in overweight men and women. The methods use in ...

Canadian Science Publishing, Nrc Research Press2013

Traps and Pitfalls of Using Contact Traces in Performance Studies of Opportunistic Networks

Jean-Yves Le Boudec, Nikodin Ristanovic, Georgios Theodorakopoulos

Contact-based simulations are a very popular tool for the analysis of opportunistic networks. They are used for evaluation of networking metrics, for quantifying the effects of infrastructure and for the design of forwarding strategies. However, little evi ...

Ieee2012

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Marcin Poturalski

2011

Secure Neighbor Discovery and Ranging in Wireless Networks

Marcin Poturalski

This thesis addresses the security of two fundamental elements of wireless networking: neighbor discovery and ranging. Neighbor discovery consists in discovering devices available for direct communication or in physical proximity. Ranging, or distance boun ...

EPFL2011

Efficiently Maintaining Distributed Model-Based Views on Real-Time Data Streams

Karl Aberer, Ho Young Jeung, Petre Alexandru Arion

Minimizing communication cost is a fundamental problem in large-scale federated sensor networks. Maintaining model-based views of data streams has been highlighted because it permits efficient data communication by transmitting parameter values of models, ...

IEEE2011

Efficiently Maintaining Distributed Model-Based Views on Real-Time Data Streams

Karl Aberer, Sebastian Michel, Ho Young Jeung, Petre Alexandru Arion

Minimizing communication cost is a fundamental problem in large-scale federated sensor networks. Existing solutions applicable for the problem are often ad-hoc for specific query types, or they are inefficient when query results contain large volumes of da ...

2011

A Hybrid Strategy for Real-Time Traffic Signal Control of Urban Road Networks

Anastasios Kouvelas

The recently developed traffic signal control strategy known as traffic-responsive urban control (TUC) requires availability of a fixed signal plan that is sufficiently efficient under undersaturated traffic conditions. To drop this requirement, the well-k ...

2011

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