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.

We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving good sufficient conditions for stability and delay bounds for these networks is of fundamental importance if we want to offer quality of service guarantees in such networks as Diffserv networks, high speed switches and network-on-chips. The main existing suff

The ever-growing popularity of the Internet is dramatically changing the landscape of the communications marketplace. The two separate worlds of the Internet and Telecommunications are converging. The respective advantages of the two environments are being integrated to fulfill the promise of the information super-highways. In this paper, we examine the impact of the Internet on the main telecommunication architectures, namely the IN, the TMN and TINA. There are two new tendencies for implementing telephony

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; it is time varying if the condition on the output is given by a time varying traffic contract. This occurs, for example, with renegotiable variable bit rate (RVBR) services. We focus on the class of time varying shapers called time varying leaky bucket

Some misbehavior detection and reputation systems in mobile ad-hoc networks rely on the dissemination of information of observed behavior, which makes them vulnerable to false accusations. This vulnerability could be removed by forbidding the dissemination of information on observed behavior in the first place, but, as we show here, this has more drawbacks than a solution that allows dissemination and copes with false accusations. We propose a method for reducing the impact of false accusations. In our appr

We consider cyber-physical systems (CPSs) comprising a central controller that might be replicated for high-reliability, and one or more process agents. The controller receives measurements from process agents, causing it to compute and issue setpoints tha ...

Recent benchmarks indicate that the use of public key cryptography results in non negligible verification times on platforms with limited processing power. In this paper, we focus on multi-hop Inter-Vehicle Communication and show that the increase in message processing time in vehicular nodes degrades network performance, decreasing the number of messages that reach destinations. We propose Adaptive Message Authentication (AMA), a lightweight filtering scheme that reduces the number of cryptographic operati

We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving good sufficient conditions for stability and delay bounds for these networks is of fundamental importance if we want to offer quality of service guarantees in such networks as DiffServ networks, high speed switches and network-on-chips. The main existing suff

HomePlug AV (HPAV) was designed to provide high speed in-home communication with 200Mbps PHY rate, with the goal to overcome various noises over power wires and to jump from one phase to a neighboring one. A HomePlug AV Logical Networks (AVLN) is defined by cryptographic means, i.e. stations that share the same key and hear each other are in the same AVLN; however, AVLNs which coexist in a neighborhood cannot communicate but share the same physical layer. These points imply that people using HomePlug AV may

We study the stability of a Markovian model of electricity production and consumption that incorporates production volatility due to renewables and uncertainty about actual demand versus planned production. We assume that the energy producer targets a fixe ...

The paper considers the problem of estimating the parameters of the compound admittance matrix of three-phase untransposed low-and medium-voltage electrical distribution networks using synchrophasor measurements from phasor measurement units (PMUs). The wo ...

We evaluate, by measurements on a real testbed, the performance of networking services required for spot applications. We call a “spot application” an application for smartphones (such as “Ad-hoc Flash Sales”) that disseminates information in a local neigh ...

Real-time control systems (RTCSs) tolerate delay and crash faults by replicating the controller. Each replica computes and issues setpoints to actuators over a network that might drop or delay messages. Hence, the actuators might receive an inconsistent set of setpoints. Such inconsistency is avoided either by having a single primary replica compute and issue setpoints (in passive replication) or a consensus algorithm select one sending-replica (in active replication). However, due to the impossibility of a

Deficit Round-Robin (DRR) is a widespread scheduling algorithm that provides fair queueing with variable-length packets. Bounds on worst-case delays obtained with DRR were found by Boyer et al. They used a rigorous network calculus approach and characteriz ...

The simulation of mobility models such as the random waypoint often cause subtle problems, for example the decay of average speed as the simulation progresses, a difference between the long term distribution of nodes and the initial one, and sometimes the ...

We introduce Markov Decision Evolutionary Games with N players, in which each individual in a large population interacts with other randomly selected players. The states and actions of each player in an interaction together determine the instantaneous payo ...

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 ...

The conventional approach for the control of distribution networks, in the presence of active generationand/or controllable loads and storage, involves a combination of both frequency and voltage regulation atdifferent time scales. With the increased penet ...

We designed the terminode routing protoc ol with the objective to scale in large mobile ad hoc networks where the topology, or node distribution, is irregular. Our routing protocol is a combination of two protocols: Terminode Local Routing (TLR - to reach a close destination) and Terminode Remot e Routing (TRR - to send data to remote destinations). TRR is the key element to achieve scalability and reduce dependence on intermediate systems. Termin-ode routing uses anchored paths, a list of geographic points

We consider the transmission of variable bit rate (VBR) video over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. The guaranteed service requires that the flow accepted by the network has to be conforming with a traffic envelope \sigma; in return, it receives a service guarantee expressed by a network service curve \beta. Functions \sigma and \beta are derived from the parameters used for setting up the reservation, for example, from the T-SPEC and R-SPEC fiel

Jean-Yves Le Boudec

Chat with Graph Search

Generalization of the RIN result to heterogeneous networks of aggregate schedulers and leaky bucket constrained flows

The Impact of the Internet on Telecommunication Architectures

The Renegotiable Variable Bit Rate Service

Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks

Ordering Events Based on Intentionality in Cyber-Physical Systems

Adaptive Message Authentication for Multi-Hop Networks

The Impact of the Internet on Telecommunication Architectures

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

Coexistence of Multiple HomePlug AV Logical Networks: A Measurement Based Study

Stability of a Stochastic Model for Demand-Response

Compound Admittance Matrix Estimation of Three-phase Untransposed Power Distribution Grids using Synchrophasor Measurements

Empirical Performance Evaluation of Data Dissemination Mechanisms for Spot Applications

Quarts: Quick Agreement for Real-Time Control Systems

Deficit Round-Robin: A Second Network Calculus Analysis

Understanding the simulation of mobility models with Palm calculus

Mean Field Asymptotic of Markov Decision Evolutionary Games and Teams

Interleaved Weighted Round-Robin: A Network Calculus Analysis

A composable method for real-time control of active distribution networks with explicit power set points. Part I: Framework

A Scalable Routing Method for Irregular Mobile Ad Hoc Networks

Optimal Smoothing for Guaranteed Service