Concept

End-to-end delay

Publications associées (107)

Constraining the microlensing effect on time delays with a new time-delay prediction model in H-0 measurements

Frédéric Courbin, Martin Raoul Robert Millon, Hung-Hsu Chan, Vivien François Bonvin, Karina Alexandra Rojas Olate

Time-delay strong lensing provides a unique way to directly measure the Hubble constant (H-0). The precision of the H-0 measurement depends on the uncertainties in the time-delay measurements, the mass distribution of the main deflector(s), and the mass di ...

OXFORD UNIV PRESS2018

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Exogenous priority rules for the capacitated passenger assignment problem

Michel Bierlaire, Mohammad Yousef Maknoon, Stefan Yves Gabriel Binder

We propose a novel algorithm for the capacitated passenger assignment problem in public transportation where exogenous priority lists define the order in which passengers are assigned. Separating explicitly theses rules from the assignment procedure allows ...

Pergamon-Elsevier Science Ltd2017

Low-latency Blockchain Consensus

Bryan Alexander Ford, Eleftherios Kokoris Kogias, Cristina Basescu

Blockchains are increasingly attractive due to their decentralization, yet inherent limitations of high latency, in the order of minutes, and attacks on consensus cap their practicality. We introduce Blinkchain, a Byzantine consensus protocol that relies o ...

2017

Observer Placement for Source Localization: the Effect of Budgets and Transmission Variance

Patrick Thiran, Laura Elisa Celis, Brunella Marta Spinelli

When an epidemic spreads in a network, a key question is where was its source, i.e., the node that started the epidemic. If we know the time at which various nodes were infected, we can attempt to use this information in order to identify the source. Howev ...

2016

Simple predictive electron transport models applied to sawtoothing plasmas

Olivier Sauter, Timothy Goodman, Antoine Pierre Emmanuel Alexis Merle, Doohyun Kim

In this work, we introduce two simple transport models to evaluate the time evolution of electron temperature and density profiles during sawtooth cycles (i.e. over a sawtooth period time-scale). Since the aim of these simulations is to estimate reliable p ...

Plasma Physics and Controled Fusion2016

Single photons from dissipation in coupled cavities

Vincenzo Savona, Hugo Pierre Alexandre Flayac

We propose a single-photon source based on a pair of weakly nonlinear optical cavities subject to a one-directional dissipative coupling. When both cavities are driven by mutually coherent fields, sub-Poissonian light is generated in the target cavity even ...

Amer Physical Soc2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

2016

Energy Proportionality and Workload Consolidation for Latency-Critical Applications

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac

Energy proportionality and workload consolidation are important objectives towards increasing efficiency in large-scale datacenters. Our work focuses on achieving these goals in the presence of applications with microsecond-scale tail latency requirements. ...

2015

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