Publication

Extending R2P2 with Congestion Control and Request-Level Scheduling

Publications associées (34)

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

The Virtue of Patience when Scheduling Media in Presence of Feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedback. Given an estimation of future transmission resources and knowing about past transmissions and received acknowledgments, a scheduling ...

EUSIPCO2005

The virtue of patience in low complexity scheduling of packetized media with feedback

Pascal Frossard, Christophe De Vleeschouwer

We consider streaming of pre-encoded and packetized media over best-effort networks in presence of acknowledgment feedbacks. We first review the rate-distortion optimization framework in such scenarios. Given an estimation of future transmission resources, ...

2005

Parallelization and scheduling of data intensive particle physics analysis jobs on clusters of PCs

Roger Hersch, Sébastien Ponce

Scheduling policies are proposed for parallelizing data intensive particle physics analysis applications on computer clusters. Particle physics analysis jobs require the analysis of tens of thousands of particle collision events, each event requiring typic ...

IEEE Computer Society, Los Alamitos;Massey University, Palmerston, CA 90720-1314, United States;New Zealand2004

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

Scheduler modeling based on the controller synthesis paradigm

Joseph Sifakis

The controller synthesis paradigm provides a general framework for scheduling real-time applications. Schedulers can be considered as controllers of the applications; they restrict their behavior so that given scheduling requirements are met. We study a mo ...

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

A methodology for the construction of scheduled systems

Joseph Sifakis

We study a methodology for constructing scheduled systems by restricting successively the behavior of the processes to be scheduled. Restriction is used to guarantee the satisfaction of two types of constraints: schedulability constraints characterizing ti ...

2000

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter'' differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

Asymmetric Best Effort Service for Packet Networks

Jean-Yves Le Boudec, Patrick Thiran, Ljubica Blazevic

1998