Concept

Best effort (réseau)

Publications associées (60)

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

On Collision-fast Atomic Broadcast

Rodrigo Malta Schmidt, Fernando Pedone

Atomic Broadcast, an important abstraction in dependable distributed computing, is usually implemented by many instances of the well-known consensus problem. Some asynchronous consensus algorithms achieve the optimal latency of two (message) steps but cann ...

2007

Quality of Service Provided by Deficit Round Robin Algorithm

Nevena Vratonjic, Nevena Krsmanovic

In this paper we examine performance of the switches with output buffers for traffic with reservations and best-effort traffic. Packets are scheduled according to the Deficit Round Robin (DRR) algorithm. The DRR has been modeled, and quality of service in ...

2006

Media Streaming with Conservative Delay on Variable Rate Channels

Pascal Frossard, Dan Jurca

We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...

2006

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

Achievable Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels

Sanket Dusad

In this paper, we present an efficient protocol for the delay-limited fading Automatic Retransmission reQuest single relay channel. The source is using an ARQ retransmission protocol to send data to the relay and the destination. When the relay is able to ...

2005

Effect of Recognition Errors on Information Retrieval Performance

Alessandro Vinciarelli

This work shows experiments on the retrieval of handwritten documents. The performance of the same state-of-the-art Information Retrieval system is compared when dealing with manual (no errors) and automatic (Word Error Rate around 50%) transcriptions of t ...

IDIAP2004

Effect of Recognition Errors on Information Retrieval Performance

Alessandro Vinciarelli

2004

Optimistic atomic broadcast: a pragmatic viewpoint

André Schiper, Fernando Pedone

Optimistic atomic broadcast: a pragmatic viewpoint F.Pedone and A.Schiper This paper presents the Optimistic Atomic Broadcast algorithm (OPT-ABcast) which exploits the spontaneous total-order property experienced in local-area networks in order to allow fa ...

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