Concept

End-to-end delay

Publications associées (107)

Deterministic End-to-End Delay Guarantees in a Heterogeneous Route Interference Environment

Some of the known results for delivering deterministic bounds on end-to-end queuing delay in networks with constant packet sizes and constant link rates rely on the concept of Route Interference. Namely, it is required to know the number of flows joining o ...

2003

Measurement and Analysis of Single-Hop Delay on an IP Backbone Network

Patrick Thiran

We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...

2003

Adaptive Joint Playout Buffer and FEC Adjustment for Internet Telephony

Jean-Yves Le Boudec, Catherine Boutremans

We develop a joint playout buffer and Forward Error Correction (FEC) adjustment scheme for Internet Telephony, which incorporates the impact of end-to-end delay on the perceived audio quality. We show that it provides better quality than the adjustment sch ...

2003

Delay aspects in Internet telephony

Catherine Boutremans

In this work, we address the transport of high quality voice over the Internet with a particular concern for delays. Transport of interactive audio over IP networks often suffers from packet loss and variations in the network delay (jitter). Forward Error ...

EPFL2003

Adaptive joint playout buffer and FEC adjustement for Internet Telephony

Jean-Yves Le Boudec, Catherine Boutremans

We develop a joint playout buffer and Forward Error Correction (FEC) adjustment scheme for Internet Telephony that incorporates the impact of end-to-end delay on the perceived audio quality. We show that it provides a better quality than the adjustment sch ...

2002

Stochastic Analysis of Some Expedited Forwarding Networks

Jean-Yves Le Boudec, Milan Vojnovic

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

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

2001

Stochastic Analysis of Some Expedited Forwarding Networks

Jean-Yves Le Boudec, Milan Vojnovic

2001

Adaptive Delay Aware Error Control for Internet Telephony

Jean-Yves Le Boudec, Catherine Boutremans

Forward Error Correction copes with packet losses, but at the expense of an increase of the end-to-end delay. By failing to take this into account, existing error control schemes for audio often lead to end-to-end delays larger than 150 ms, which has an im ...

2001

Network Calculus

Jean-Yves Le Boudec, Patrick Thiran

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

Springer Verlag2001

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