Publications de Jean-Yves Le Boudec

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.

The efficiency of the adaptive immune system is dependent on the diversity of T- and B-cell receptors, which is created by random rearrangement of receptor gene segments. AmpliCot is an experimental technique that allows the measurement of the diversity of ...

The interleaved regulator (implemented by IEEE TSN Asynchronous Traffic Shaping) is used in time-sensitive networks for reshaping the flows with per-flow contracts. When applied to an aggregate of flows that come from a FIFO system, an interleaved regulato ...

We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We introduce the distinction between space and time methods for such systems. Space methods are related to min-plus system theory, while time methods borrow from dynamic programming and exploit the causality of the operators. We apply this to the window flow control problem previously studied by Cruz and Okino

The paper describes a heuristic method for the ultra-short-term computation of prediction intervals (PIs) for photovoltaic (PV) power generation. The method allows for directly forecasting the AC active power output of a PV system by simply extracting info ...

Connection Admission Control (CAC) algorithms are used to decide whether an incoming connection should be accepted or rejected in a node of a network offering reservation based services in order to maintain the guaranteed Quality of Service (QoS) in the network. In this paper, we consider the statistical CAC algorithm proposed by Elwalid et al. [ 2 ]. The traffic model is made of ON-OFF sources and the QoS parameter is the loss probability. Based on the traffic descriptors of existing and incoming connectio

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 it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...

An electric vehicle (EV) charging method which considers the EVs heterogeneity, taking into account the absence of any information about future arrivals and departures, and of the amount of time any charging will take. The method further considers both swi ...

We provide an algorithm for computing best paths on a graph where edges have a multidimensional cost, one dimension representing delay, the others representing available capacity. Best paths are those which guarantee maximum capacity with least possible delay. The complexity of the algorithm is of the order of O(V3) in the bidimensional case, for a graph withV vertices. The results can be used for routing connections with guaranteed capacity in a communication network.

We study the fairness of TCP Vegas. The latter is an alternative to the commonly used TCP Reno, and uses measures of the round trip time as feedback on congestion. We consider two cases that depend on the value of the two parameters alpha and beta controlling the window sizes` update. Our main conclusion is that TCP Vegas is unfair in several points. First, when alpha = beta, if the propagation delays are correctly estimated, TCP Vegas is known to be fair. However we show that any over-estimation of the pro

We consider real-time control systems that consist of a controller that computes and sends setpoints to be implemented in physical processes through process agents. We focus on systems that use commercial off-the-shelf hardware and software components. Set ...

Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective function called

F_A^h

(``

F_A^h

fairness). We derive this result under the assumption of rate proportional negative feedback and for the regime of rare negative feedback. This applies to TCP in moderately loaded networks, and to those TCP implementation

It is a well-known fact that the progress of personal communication devices leads to serious concerns about privacy in general, and location privacy in particular. As a response to these issues, a number of Location-Privacy Protection Mechanisms (LPPMs) ha ...

The traffic generated by multimedia applications presents a high degree of burstiness that can be hardly described by a static set of traffic parameters. We present a dynamic QoS negotiation scheme applied to a prototype application that provides temporized data transfer. The dynamic and efficient usage of the resources can be reached with the introduction of the renegotiable variable bit rate (RVBR) service, which is based on the renegotiation of the traffic specification. We describe and discuss the RVBR

We consider a scenario where multimedia data is sent over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. A smoothing device writes the stream into a networking device for transmission, possibly with some pre-fetching; at the destination, the decoder waits for an initial playback delay and reads the stream from the receive buffer. We consider the problem of whether there exists a smoothing which minimizes the playback delay and the receive buffer size over all

In many envisioned mobile ad hoc networks, nodes are expected to periodically beacon to advertise their presence. In this way, they can receive messages addressed to them or participate in routing operations. Yet, these beacons leak information about the n ...

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile. Terminode routing, presented here, addresses these issues. It uses a combination of location based routing (Terminode Remote Routing, TRR), used when the destination is far, and link state routing (Terminode Local Routing, TLR), used when the destination is close. TRR use

The user-generated podcasting service over mobile opportunistic networks can facilitate the user generated content dissemination while humans are on the move. However, in such a distributed and dynamic network environment, the design of efficient content f ...

Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive; it is based on selective altruism and utilitarianism. It aims at detecting and isolating misbehaving nodes, thus making it unattractive to deny cooperation. Trust relationships and routing decisions are based on experienced, observed, or reported routing

Reputation systems in mobile ad-hoc networks can be tricked by the spreading of false reputation ratings, be it false accusations or false praise. Simple solutions such as exclusively relying on one's own direct observations have drawbacks, as they do not make use of all the information available. We propose a fully distributed reputation system that can cope with false disseminated information. In our approach, everyone maintains a reputation rating and a trust rating about everyone else that they care abo

The min-plus theory of greedy shapers has been developed after Cruz's results on the calculus of network delays. An example of greedy shaper is the buffered leaky bucket controller. The theory of greedy shapers establishes a number of properties; for example, re-shaping keeps original arrival constraints. The existing theory applies in all rigor either to fluid systems, or to packets of constant size such as ATM. For variable length packets, the distortion introduced by packetization affects the theory, whi

Jean-Yves Le Boudec

Chattez avec Graph Search

A Generalized Mathematical Model To Estimate T- and B-Cell Receptor Diversities Using AmpliCot

Network-calculus service curves of the interleaved regulator

A note on Time and Space Methods in Network Calculus

Ultra-short-term prediction intervals of photovoltaic AC active power

Regulation of a Connection Admission Control Algorithm

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

Real-time control of an electric vehicle charging station while tracking an aggregated power-setpoint

A route pre-computation algorithm for integrated services networks

A Note on the Fairness of TCP Vegas

Axo: Masking Delay Faults in Real-Time Control Systems

Global Fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times

Quantifying Location Privacy

The Renegotiable Variable Bit Rate Service: characterisation and prototyping

Optimal Smoothing for Guaranteed Service

On the Age of Pseudonyms in Mobile Ad Hoc Networks

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Reputation system for User Generated wireless podcasting

Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks

A Robust Reputation System for Mobile Ad-hoc Networks

Some properties of variable length packet shapers