Concept

Commutation de paquets

Publications associées (15)

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

EPFL2023

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

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 ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Deficit Round-Robin: A Second Network Calculus Analysis

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

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

2021

Exploiting the Path Propagation Time Differences in Multipath Transmission with FEC

Maciej Kurant

We consider a transmission of a delay-sensitive data stream (e. g., a video call) from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet ...

2011

Nouveaux mécanismes de commutation pour des structures dédiées aux convertisseurs de puissance de haute efficacité et interrupteurs du futur

Daniel Siemaszko

Nowadays, the scarcity of cheap energy sources requires a particular effort in optimizing the performance of all conversions. The electric power vector is particulary expected to grow in importance, in conjunction with the development of renewable energy s ...

EPFL2009

Exploiting the Path Propagation Time in Multipath Transmission with FEC

We consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet. An effective and wel ...

2009

Robustness to failures in two-layer communication networks

Maciej Kurant

A close look at many existing systems reveals their two- or multi-layer nature, where a number of coexisting networks interact and depend on each other. For instance, in the Internet, any application-level graph (such as a peer-to-peer network) is mapped o ...

EPFL2009

End-to-end congestion control for tcp-friendly flows with variable packet size

Jean-Yves Le Boudec, Jörg Widmer, Catherine Boutremans

Current TCP-friendly congestion control mechanisms adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection operating under the same conditions. In an environment where the bottleneck res ...

2004

Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness

Jean-Yves Le Boudec, Sonja Buchegger

In mobile ad-hoc networks, nodes do not rely on any routing infrastructure but relay packets for each other. Thus communication in mobile ad-hoc networks functions properly only if the participating nodes cooperate in routing and forwarding. However, it ma ...

2002

Some Properties Of Variable Length Packet Shapers

Jean-Yves Le Boudec

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 such as th ...

2002

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search