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.

Some forms of ad-hoc networks need to operate in extremely performance- challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet” only occasionally and are ab ...

Given the increasing demand for services that can guarantee a maximum end-to-end delay in the Internet, it is important to understand the behaviour of different existing networks. We consider networks that implement scheduling per aggregate flow. We give a worst case bound that is valid for any network topology given the maximum hop count for every flow and the utilization at every link. Unfortunately, this bound is finite only for small utilization. Using the context of arrival and service curves we can im

We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, ...

We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem arises in scenarios where aggregate multiplexing is performed, such as differentiated services or front ends to optical switches. We obtain an exact result for a fluid model and for piecewise linear concave arrival curves, which are common in practice and correspond to combinations of leaky buckets.

Emergent phenomena occur due to the pattern of non-linear and distributed local interactions between the elements of a system over time. An example of such phenomena is the spontaneous self-organisation of drinking parties in the squares of cities in Spain, also known as

El Botellon". The emergence of self-organisation was shown to depend critically on the chat-probability, i.e. the probability that a person finds someone to chat with in a square of the city. We consider a variant of

El Botellon" in whi

Mapping algorithm for protecting a network using a Wavelength Division Multiplexing (WDM) infrastructure against component or link failures while respecting capacity constraints.

The research of this paper is framed in the context of multi-layered, optimization-based approaches for microgrid control. Specifically, we focus on the design of real-time objectives that are typically proxies of long-term ones. Examples include tracking ...

The paper proposes a specific algorithm for the pre-estimation filtering of bad data (BD) in PMU-based power systems linear State Estimators (SEs). The approach is framed in the context of the so-called real-time SEs that take advantage of the high measure ...

Aggregation of electric resources is a fundamental function for the operation of power grids at different time scales. In the context of a recently proposed framework for the real-time control of microgrids with explicit power setpoints, we define and form ...

We derive the Ziv-Zakai lower bound for Impulse Radio (IR) Ultra-WideBand (UWB) ranging error correlation matrix under a classical IR-UWB positioning system. We present the numerical evaluations with IEEE 802.15.4a channel model and the geometry of indoor environments of interest. As our derived bound depends on the geometry of the indoor environments, our bound can be used in real environments with the channel measurements from real environments.

Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty nodes simply misbehave accidentally. Regardless of the motivation for misbehavior its impact on the mobile ad-hoc network proves to be detrimental, decreasing the performance and the fairness of the network, and in the extreme case, resulting in a non-fun

We demonstrate and validate that concurrent and parallel transmissions are feasible for low data-rate impulse-radio ultrawide band (IR-UWB) physical layers. The optimal organization for a low data-rate IR-UWB network is to allow for concurrent transmissions at the link layer, and to use interference mitigation techniques at the physical layer. Indeed, low data-rate IRUWB physical layers can suffer from multi-user interference (MUI), especially in near-far scenarios. Therefore, we perform an experimental val

The present invention concerns a method of generating setpoints for actuators (13) of a real-time control system. The method comprises a first controller (9): a) receiving a first set of measurements from sensors (3), the measurements being individually la ...

We found an inconsistency between biological data and some of the initial conditions of the mathematical model of tumor growth in ``A Validated Mathematical Model of Cell- Mediated Immune Response to Tumor Growth'' dePillis2005. We show that correcting thi ...

As fossil fuel reserves are limited in stock and there is an urgent call to reduce the carbon footprint, distribution grids urgently need to move towards heavy use of local and distributed generation of electricity using renewable energy sources. Another p ...

We describe stochastic reaction models and their use to model some global aspects of the immune system. We describe the mathematical concepts, how they can be used to simulate a model, and the link between deterministic and random models.

We consider the issue of increasing the number of connections that connection or iented networks, such as ATM, can handle. We describe one step that aims at reducing connection awareness inside the netwo rk. To that end, connections between the same pair of access nodes are grouped toget her and made indistinguishable inside the network. The concept of dynamic virtual path trunks is introduced as a support mechanism, and it is shown how virtual path links can be setup and maintained without addi tional roun

Current resource reservation architectures for multimedia networks do not scale well for a large number of flows. We propose a new architecture that automatically aggregates flows on each link in the network. Therefore, the network has no knowledge of individual flows. There is no explicit signalling protocol, and the protocol overhead mainly consists in the introduction of a packet type with three values (reserved, request or best-effort) which can be encoded on two bits. Keywords: Resource reservation, In

Jean-Yves Le Boudec

Chat with Graph Search

Network coding for efficient communication in extreme networks

A Delay Bound for a Network with Aggregate Scheduling

"Pay bursts only once" does not hold for non-FIFO Guaranteed Rate nodes

Worst case burstiness increase due to FIFO multiplexing

Revisiting the Limit Behaviour of ``El Botellon"

Design Protection for WDM Optical Networks

Worst Case Burstiness Increase due to FIFO Multiplexing

Worst Case Burstiness Increase due to FIFO Multiplexing

Design of cost functions for the real-time control of microgrids hosting distributed energy-storage systems

A pre-estimation filtering process of bad data for linear power systems state estimators using PMUs

Aggregation of Power Capabilities of Heterogeneous Resources for Real-Time Control of Power Grids

Ziv-Zakai Lower Bound for Impulse Radio Ultra-WideBand Ranging Error Correlation Matrix

Self-Policing Mobile Ad-hoc Networks

Concurrent Transmissions in IR-UWB Networks: an Experimental Validation

A controller and an agreement protocol for a real-time control system

Comment on : A Validated Model of Cell-Mediated Immune Response to Tumor Growth

Technologies for Integration of Large-Scale Distributed Generation and Volatile Loads in Distribution Grids

Modelling the Immune System Toolbox: Stochastic Reaction Models

Scalability Enhancements for Connection-Oriented Networks

SRP: a Scalable Resource Reservation Protocol for the Internet