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.

Self-organized networks such as mobile ad-hoc, Internet-based peer-to-peer, wireless mesh and Fourth Generation (4G) Wireless networks depend on cooperation of nodes. Reputation systems help nodes decide with whom to cooperate and which nodes to avoid. The ...

In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, see http://www.terminodes.org) that investigates issues and challenges in MAWANs. The name of the project comes from the fact that the elements of the network act as nodes and terminals at the same (terminodes).

For impulse-radio ultra-wide band (IR-UWB) networks without global synchronization, the first step for correct packet reception is packet detection and timing acquisition: Before recovering the payload of the packet, the destination must detect that the pa ...

Microgrids and, in general, active distribution networks require ultra-short-term prediction, i.e., for subsecond time scales, for specific control decisions. Conventional forecasting methodologies are not effective at such time scales. To address this iss ...

Energy-detection receivers are appealing to IEEE 802.15.4a low data-rate networks because of their low complexity. With a reasonable energy consumption, these receivers can exploit the ranging capabilities and multipath resistance of impulse-radio UWB (IR- ...

User-generated podcasting service over human-centric opportunistic network can facilitate user-generated content sharing while humans are on the move beyond the coverage of infrastructure networks. We focus on the aspects of designing efficient forwarding ...

Schemes - Hardware duplication or Mapping algorithm - for protecting a network using a Wavelength Division Multiplexing (WDM) infrastructure against component or link failures.

We consider the problem of bounding the probability of buffer overflow in a network node receiving independent inputs that are each constrained by arrival curves, but that are served as an aggregate. Existing results (for example \cite{kesidis-00-b} and \cite{chang-01-a}) assume that the node is a constant rate server. However, in practice, one finds various types of schedulers that do not provide a constant service rate, and thus to which the existing bounds do not apply. Now many schedulers can be adequat

The Scalable Reservation Protocol (SRP) provides a light-weight reservation mechanism for adaptive multimedia applications. Our main focus is on good scalability to very large numbers of individual flows. End systems (i.e. senders and destinations) actively participate in maintaining reservations, but routers can still control their conformance. Routers aggregate flows and monitor the aggregate to estimate the local resources needed to support present and new reservations. There is neither explicit signalin

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

We consider the problem of controlling the charging of electric vehicles (EVs) connected to a single charging station that follows an aggregated power setpoint from a main controller of the local distribution grid. To cope with volatile resources such as l ...

Network Calculus is a collection of results based on Min-Plus algebra, which applies to deterministic queuing systems found in communication networks. It can be used for example to understand - the computations for delays used in the IETF guaranteed service - why re-shaping delays can be ignored in shapers or spacer-controllers - a common model for schedulers - deterministic effective bandwidth and much more.

For original paper see Chlamtac et al. (IEEE/ACM Trans. Networking, vol.6, no.4, p.422-31, 1998 August). We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called network calculus bounds. We also show that the delay bound in the above paper, is the sum of worst-case queueing delays at all nodes along the path of a connection.

This article provides a technical overview of mobile ad hoc networks and describes their long-term potential. It covers current research, and describes major technical challenges, including networking, real-time services, and software. It shows that by their very nature, mobile ad hoc networks can bring a paradigm shift in the way networks are organized and operated, and can even lead to a fundamental change in the relationships between information technology and societal organization. As an illustration of

We consider an electricity consumer equipped with a perfect battery, who needs to satisfy a non-elastic load, subject to external control signals. The control imposes a time-varying upper-bound on the instantaneous energy consumption (this is called ``Dema ...

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

We propose a complete design for a scope limited, multi-hop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We ...

Jean-Yves Le Boudec

Chattez avec Graph Search

Reputation Systems for Self-Organized Networks

Issues on Mobile Ad-Hoc WANs

Performance Evaluation of Impulse Radio UWB Networks using Common or Private Acquisition Preambles

Computation of ultra-short-term prediction intervals of the power prosumption in active distribution networks

Issues on Mobile Ad-Hoc WANs

An Energy Detection Receiver Robust to Multi-User Interference for IEEE 802.15.4a Networks

Reputation-Based Content Dissemination for User Generated Wireless Podcasting

Design of a Survivable WDM Photonic Network

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

SRP: a scalable resource reservation protocol for the internet

Deficit Round-Robin: A Second Network Calculus Analysis

Real-Time Control of an Electric Vehicle Charging Station While Tracking an Aggregated Power Setpoint

Network Calculus

Comment on ¨ A Deterministic Approach to the End-to-End Analysis of Packet Flows in Connection Oriented Networks¨

Towards Self-Organizing Mobile Ad-Hoc Networks: the Terminodes Project

A Demand-Response Calculus with Perfect Batteries

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks