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.

The focus of this paper is routing in a wide area mo-bile ad hoc network referred to as a Terminode Network. Our routing scheme is a combination of two protocols: Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TRR is used for rem ote destinations. It utilizes the location of a destination obtained by the source using location management or location tracking. TLR acts when the packet gets close to the destination. The use of TRR results in a scalable solution that reduces d ependen ce on t

We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at the network ingress. Both of these assumptions are inline with the current definition of EF \cite{charny-00-b,davie-01-a}. We derive bounds to the complementary distributions of the backlog, delay through a single node, and the end-to-end delay. We also gi

Reputation systems can be tricked by the spread 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 about. From time to time first-h

We consider the problem of multicast routing in a large single domain network with a very large number of multicast groups with small number of receivers. Such a case occurs, for example, when multicast addresses are statically allocated to mobile terminals, as a mechanism to manage Internet host mobility. For such networks, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. We propose an alternative solution called Distributed Core Multicast (D

We consider unicast equation-based rate control, where, at some points in time, a sender adjusts its rate to f(p,r), where p is an on-line estimate of the loss-event rate observed by this source, r of the average round-trip time, and f is a TCP throughput ...

We propose Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either Green or Blue. Green packets, typically sent by real-time appli- cations such asinteractive audio, receive more losses during bouts of congestion than Blue ones. In return, they receive less delay jitter. Both Green and Blue services are best-effort. The incentive to choose one or other is based on the nature of

Giving users simple access to QoS selection capability of ATM networks is important for the future of integrated services networks. We describe the first instance of an application in which users had the capacity to tune ATM traffic parameters with a button, at run time. To achieve this we implemented the necessary signaling extension on ATM switches as well as on end-systems. Furthermore, we extended Arequipa (Application REQested IP over ATM

We pose the estimation of the parameters of multiple superimposed exponential signals in additive Gaussian noise problem as a Maximum Likelihood (ML) estimation problem. The ML problem is very non linear and hard to solve. Some previous works focused on fi ...

We consider the definition of the Expedited Forwarding Per-Hop Behaviour (EF PHB) as given in RFC 2598, and its impact on worst case end-to-end delay jitter. On one hand, the definition in RFC 2598 can be used to predict extremely low end-to-end delay jitter, independent of the network scale. On the other hand, we find that the worst case delay jitter can be made arbitrarily large, if we allow networks to become arbitrarily large; this is in contradiction with the previous statement. We analyze where the co

Several misbehavior detection and reputation systems have been proposed for mobile ad-hoc networks, relying on direct network observation mechanisms, so-called watchdogs. While these approaches have so far only been evaluated in simulations and restricted to selfish packet dropping, we are interested in the capabilities of a watchdog detection component in a real network. In this paper we present our test-bed implementation of misbehavior detection. Following an evaluation of both the feasibility and detect

A large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasingly important to understand the implications of aggregate scheduling on the resulting QoS capabilities. This document studies the bounds on the worst case delay in a network implementing aggregate scheduling. A lower bound on the worst case delay is derived

We find that the probabilistic bound on delay in the article by Goyal et al. in 1997 is incorrect. The problem originates from: 1) the difference between stationary and Palm probabilities and 2) treating the arrival counting process over some random time intervals as if the time interval would be fixed. The error is propagated to some later work, e.g., recently by Bensaou et al., which derived some probabilistic delay bounds based on Goyal et al. in 1997. We give fixes to the above problem.

Deterministic Network Calculus provides an elegant way to compute performance bounds, e.g. bounds on backlog, delay-jitter, loss ratio, and like. Such bounds are deterministic worst-case bounds. In some cases it is practically sensible that individual flows, which share a network element, are supposed statistically independent. In this case, the results of deterministic Network Calculus would yield very conservative bounds on the actual performance. In our work we show some results of Probabilistic Network

We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time interval would be fixed. The error is propagated to some later work, e.g. [2], which derived some probabilistic delay bounds based on [2]. We give fixes to the above problem.

The Terminodes project is designing a wide area, mobile ad-hoc network, which is meant to be used in a public environment, in our approach, the network is run by users themselves. We give a global description of the building blocks used by the basic operation of the network, they all rely on various concepts of self-organization. Routing uses a combination of geography-based information and local, MANET-like protocols. Terminode positioning is obtained either by GPS, or by a relative positioning method. Mob

Network coding is a new research area that may have interesting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received information. There are two main b ...

The Terminode project follows a system approach to investigate wide area, large, totally wireless networks that we call mobile ad-hoc wide area networks. A network of terminodes is an autonomous, self-operated, wireless multimedia network, independent of any infrastructure. In this paper we present the main challenges and certain initial technical directions.

Real-time control systems use controllers that compute and issue setpoints within stringent delay constraints. Failure to do so, due to a crash or delay as a result of software and/or hardware faults, can cause failure of the controlled resources. Recently ...

Jean-Yves Le Boudec

Chat with Graph Search

A Scalable Routing Scheme for Self-Organized Terminode Network

Stochastic Analysis of Some Expedited Forwarding Networks

A Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks

Scalable IP multicast for many very small groups with many senders and its application to mobility

On the Long-Run Behavior of Equation-Based Rate Control

A Proposal for an Asymmetric Best-Effort Service

Quality of Service Renegotiations

A Novel Maximum Likelihood Estimation Of Superimposed Exponential Signals In Noise And Ultra-Wideband Application

Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks - How Much Can Watchdogs Really Do?

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

Delay Bounds in a Network with Aggregate Scheduling

Stochastic Bound on Delay for Guaranteed Rate Nodes

On Probabilistic Network Calculus

Stochastic Bound on Delay for Guaranteed Rate Nodes

Delay Bounds in a Network with Aggregate Scheduling

Self-Organization in Mobile Ad-Hoc Networks: the Approach of Terminodes

Network Coding: An Instant Primer

The Terminodes Project: Towards Mobile Ad-Hoc WANs

Axo: Detection and Recovery for Delay and Crash Faults in Real-Time Control Systems