Concept

Queuing delay

Related publications (123)

Graph Chatbot

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.

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

Jean-Yves Le Boudec

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

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

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

A convergence theorem for controlled queues with partial observations

Razvan Cristescu

We consider a queuing problem in which both the service rate of a finite-buffer queue and its rate of arrivals are functions of the same partially observed Markov chain. Basic performance indices of this device, such as long term throughput and loss rates, ...

2002

The provision of a low delay service within the best-effort Internet

Paul Hurley

In this work, we define a novel Internet service, called ABE (Alternative Best-Effort), which allows interactive multimedia applications to receive low queuing delay within the existing best-effort Internet. We then develop and analyse a number of innovati ...

EPFL2002

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

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

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Matthias Wiesmann, Fernando Pedone

Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, s ...

2001