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.

A protocol for resource reservation in the Internet which is truly scalable: routers keep only aggregate information, no per flow state.

We are interested in the security of the MPLS Transport Profile (MPLS-TP), in the context of smart-grid communication networks. The security guidelines of the MPLS-TP standards are written in a complex and indirect way, which led us to pose as hypothesis t ...

This paper aims to assess the performance of linear state estimation (SE) processes of power systems relying on synchrophasor measurements. The performance assessment is conducted with respect to two different families of SE algorithms, i.e., static ones r ...

Packet Scale Rate Guarantee (PSRG) is a generic node model which underlies the definition of Expedited Forwarding (EF) proposed in the context of Internet Differentiated Services. For the case of FIFO nodes, PSRG is equivalent to the well-understood concept of adaptive service curve. However, in practice, many devices do not necessarily preserve the FIFO property, and therefore known FIFO results do not hold. This paper analyzes the properties of PSRG in the absence of FIFO assumption. Our analysis is based

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 present explicit sufficient conditions that guarantee the existence and uniqueness of the load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the problem, we also account ...

Terminode routing, defined for potentially very large mobile ad hoc networks, forwards packets along anchored paths. An anchored path is a list of fixed geographic points, called anchors. Given that geographic points do not move, the advantage to traditional routing paths is that an anchored path is always

Method for estimating and correcting a frequency offset between a local clock of a receiving transceiver and a remote clock of an emitting transceiver comprises receiving by said receiving transceiver, a signal emitted by the emitting transceiver, said sig ...

We consider the case of a FIFO multiplexer fed by flows that are individually constrained by piecewise linear concave arrival curves. We show that, contrary to what happens at the input, at the output not all valid scenarios in accordance with the worst ca ...

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With o ...

Mobile ad-hoc networking works properly only if the par- ticipating nodes cooperate in routing and forwarding. How- ever, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive

The increased penetration of renewable energy sources in existing power systems has led to necessary developments in electricity market mechanisms. Most importantly, renewable energy generation is increasingly made accountable for deviations between schedu ...

Current resource reservation architectures for multimedia networks do not scale well for a large number of flows. We propose a new architecture that automatically aggregates flows on each link in the network. Therefore, the network has no knowledge of individual flows. There is no explicit signalling protocol, and the protocol overhead mainly consists in the introduction of a pocket type with three values (reserved, request or best-effort) which can be encoded on two bits.

We show that network coding allows to realize energy savings in a wireless ad-hoc network, when each node of the network is a source that wants to transmit information to all other nodes. Energy efficiency directly affects battery life and thus is a critic ...

Reputation systems are widely and successfully used in centralized scenarios. Will they work equally well, however, in decentralized scenarios such as Internet-based peer-to-peer systems and mobile ad hoc networks? ...

We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, but important, dependency on the FIFO assumption, which was never noticed before. Finally, we give a tight delay bound that is valid in the non-FIFO case; it is noticeably higher that the existing one. In particular, the phenomenon known as ?pay bursts onl

Jean-Yves Le Boudec

Chat with Graph Search

Scalable Resource Reservation for the Internet

Scalable Resource Reservation for the Internet

Security Vulnerabilities of the Cisco IOS Implementation of the MPLS Transport Profile

Performance Assessment of Linear State Estimators Using Synchrophasor Measurements

Packet Scale Rate Guarantee for non-FIFO Nodes

IPv6 & IPv4 potential for VLANs

Explicit Conditions on Existence and Uniqueness of Load-Flow Solutions in Distribution Networks

Packet scale rate guarantee for non-FIFO nodes

Anchored Path Discovery in Terminode Routing

Method for estimating and correcting a drift between clocks of receiving transceiver and a corresponding emitting transceiver, and receive for implementing said method

On the Feasible Scenarios at the Output of a FIFO Server

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

Analysis of a reputation system for Mobile Ad-Hoc Networks with liars

Handling Very Large Numbers of Messages in Distributed Hash Tables

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

Attribution Mechanisms for Ancillary Service Costs Induced by Variability in Power Delivery

SRP: a Scalable Resource Reservation Protocol for the Internet

A Network Coding Approach to Energy Efficient Broadcasting: from Theory to Practice

Distributed Reputation Systems for Internet-based Peer-to-Peer Systems and Mobile Ad-Hoc Networks

"Pay bursts only once" does not hold for non-FIFO Guaranteed Rate nodes