Publications by Jean-Yves Le Boudec

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Smart-grid applications based on synchrophasor measurements have recently been shown to be vulnerable to timing attacks. A fundamental question is whether timing attacks could remain undetected by bad-data detection algorithms used in conjunction with stat ...

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the max-min fair alloca-tion

In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of ...

This document is replaced by "The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation" by the same authors LCA-REPORT-2006-003 href="http://infoscience.epfl.ch/search.py?recid=81788&ln=fr

In ``Stationary Distributions for the Random Waypoint Mobility Model ...

presentation with extended abstract (see pdf)

The PHB (per-hop behavior) is a basic building block in the Differentiated Services architecture. This document defines a PHB called Expedited Forwarding (EF). EF is intended to provide a building block for low delay, low jitter and low loss services by ensuring that the EF aggregate is served at a certain configured rate.

We present sufficient conditions for the existence and uniqueness of load-flow solutions in three-phase distribution networks. The conditions can be efficiently verified for real distribution systems. ...

Public key cryptography can introduce significant processing delays in vehicular communication platforms. This can lead to serious performance issues, especially in the case of multi-hop Inter-Vehicle Communication. In this paper we propose Adaptive Messag ...

Weighted Round-Robin (WRR) is often used, due to its simplicity, for scheduling packets or tasks. With WRR, a number of packets equal to the weight allocated to a flow can be served consecutively, which leads to a bursty service. Interleaved Weighted Round ...

A shaper is a system that stores incoming bits in a buffer and delivers them as early as possible, while forcing the output to be constrained with a given arrival curve. A shaper is time invariant if the traffic constraint is defined by a fixed arrival curve

A short tutorial on network calculus, part II

A short tutorial on network calculus, part I

We consider the impact of multi-user interference on a bit-interleaved coded-modulation system with M-ary PPM (BIC M-ary PPM) in an impulse-radio ultra-wideband physical layer. In a realistic scenario such as an ad hoc network, the interference is inherent ...

La présence d’une part importante d’énergie électrique produite par des systèmes de conversion solaires et éoliens décentralisés est une perspective réjouissante pour le futur de la planète. Cependant, elle peut aussi avoir des conséquences indésirables sur l’exploitation des réseaux électriques. Les méthodes traditionnelles de contrôle de la fréquence, de la tension et de la congestion de lignes ne suffisent plus et demandent à être complétées par un contrôle explicite des puissances actives ou réactives.

Les fichiers échangés sur Internet et stockés sur les disques durs contiennent de l’information qui deviendra finalement du texte, des images ou des sons. Mais comment cette information est-elle mesurée et comprimée ? Comment est-elle sécurisée pour éviter les copies illicites ? Comment est-elle protégée contre les erreurs lors d’une recopie ? Voici les questions auxquelles répond cet ouvrage. Sans équivalent dans la littérature, il présente pour la première fois les théories de l’entropie, du codage et de

Jean-Yves Le Boudec

Chat with Graph Search

Undetectable Timing-Attack on Linear State-Estimation by Using Rank-1 Approximation

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks

The Random Trip Model, Part II: Stationary Regime and erfect Simulation

On the Stationary Distribution of Speed and Location of Random Waypoint

Getting Rid of Cheats and Liars in Mobile Ad-hoc Networks

An Expedited Forwarding PHB (draft standard-track RFC)

Existence and Uniqueness of Load-Flow Solutions in Three-Phase Distribution Networks

Adaptive Message Authentication for Vehicular Networks

Interleaved Weighted Round-Robin: A Network Calculus Analysis

On the benefits of network coding for wireless applications

Terminode Routing - A Scalable Routing Scheme for Large Mobile Ad Hoc Networks

On a Class of Time Varying Shapers with Application to the Renegotiable Variable Bit Rate Service

A short tutorial on network calculus II: min-plus system theory applied to communication networks

A short tutorial on network calculus I: fundamental bounds in communication networks

Effect of Interfering Users on the Modulation Order and Code Rate for UWB Impulse-Radio Bit-Interleaved Coded M-ary PPM

Pilotage automatique des réseaux de distribution en temps réel

Introduction aux sciences de l'information

A Route Pre-Computation Algorithm for Integrated Services Networks

An Expedited Forwarding PHB (Per-Hop Behavior)