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 document itself is an extended abstract.

We analyse the performance of the multiplexing of heterogenous VBR connections over a VBR trunk.

We demonstrate that an interferer with malicious intentions can significantly degrade the performance of impulse radio (IR) ranging. The cicada attack we have developed can decrease the distance (degradation of service) measured by ranging algorithms desig ...

Node misbehavior due to selfish or malicious reasons or faulty nodes can significantly degrade the performance of mobile ad-hoc networks. To cope with misbehavior in such self-organized networks, nodes need to be able to automatically adapt their strategy ...

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

Alternative best effort (ABE) is a novel service for IP networks, which relies on the idea of providing low delay at the expense of possibly less throughput. The objective is to retain the simplicity of the original Internet single-class best-effort service while providing low delay to interactive adaptive applications.

We investigate if it is possible to reconstruct a mobile phone’s mobility using its Bluetooth contacts with other mobile devices, some of which are equipped with GPS receivers. Our data mining analysis, based on two different data sets, shows that in certa ...

We propose a detection method for pulse level synchronization in the presence of Inter-User Interference (IUI),in particular in the Near-far scenario. Further, we investigate concurrent transmissions using the same time hopping code.

We show that ATM UBR with adequate buffering results in better overall throughput for TCP than explicit rate ATM ABR for LAN interconnection.

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 or frequently dis ...

Time-sensitive networks, as in the context of IEEE-TSN and IETF-Detnet, require bounds on worst-case delays. Various network analysis tools compute such bounds; these tools are based on different methods and provide delay bounds that are all valid but may ...

We propose an encoding of the packet types used by SRP (Scalable Reservation Protocol) in the DS byte under study by the Differentiated Services working group.

This technical report is replaced by the revised version "Understanding the Simulation of Mobility Models with Palm Calculus" LCA-REPORT-2005-013 http://infoscience.epfl.ch/search.py?recid=52736&ln=en

Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate burstiness of the traffi ...

This paper gives a succinct description of the design of SRP, a highly scalable resource reservation protocol for Internet traffic.

We consider one aspect of the general problem of unicast equation based rate control in the Internet, which we formulate as follows. When a so called ``loss-event

The benefits that Virtual LANs offer can be realized by using features of an IPv6 network along with small enhancements the IPv6 and DHCPv6 protocol stacks.

We will present the design, implementation and our first experience with Arequipa. Arequipa is a method for providing the quality of service of ATM to TCP/IP applications without requiring any cooperation in the network between IP and ATM. It does not need any modifications in the ATM or IP networks

We consider a scenario where multimedia data are sent over a network offering a guaranteed service. A smoothing device writes the stream into a transmitting device with limited input buffer

This document is replaced by "The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation" by the same authors LCA-REPORT-2006-003 href="http://infoscience.epfl.ch/search.py?recid=81788&ln=fr

Jean-Yves Le Boudec

Chattez avec Graph Search

An Artificial Immune System for Misbehavior Detection in Mobile Ad Hoc Networks with both Innate, Adaptive Subsystems and with Danger Signal

Multiplexing of heterogeneous VBR connections over a VBR trunk

The Cicada Attack: Degradation and Denial of Service in IR Ranging

Self-Policing Mobile Ad-Hoc Networks by Reputation

Some properties of variable length packet shapers

ABE: providing a low-delay service within best effort

Tracking of Mobile Devices Through Bluetooth Contacts

A Power Independent Detection Method for UltraWide Band (UWB) Impulse Radio Networks

A Comparison of ABR and UBR to support TCP traffic for LAN Interconnection

A Location Based Routing Method for Mobile Ad Hoc Networks

Saihu: A common interface of worst-case delay analysis tools for time-sensitive networks

Encoding of SRP packet types in the DS byte

Understand the Simulation of Mobility Models with Palm Calculus

Quasi-Deterministic Burstiness Bound for Aggregate of Independent, Periodic Flows

SRP essentials

Some Observations on Equation-Based Rate Control

Realizing the Benefits of Virtual LANs by Using IPv6

Arequipa: Using TCP/IP over ATM with quality of service is simple... if you have ATM end-to-end

Network Calculus applied to Optimal Multimedia Smoothing

The Random Trip Model, Part I: Stability