Concept

Network scheduler

Publications associées (138)

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

Supplemental Information for the New Definition of the EF PHB

Jean-Yves Le Boudec

This document is intended to supplement [6]. Its primary motivation is providing additional explanation to the revised EF definition and its properties. The document also provides additional implementation examples and gives some guidance for computation o ...

2001

Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Levente Buttyan

In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node ...

2001

Preferential Treatment of Acknowledgment Packets in a Differentiated Services Network

Patrick Thiran

In the context of Differentiated Services (DiffServ), we investigate the effect of acknowledgment marking on the throughput of TCP connections. We carry out experiments on a testbed offering three classes of service (Premium, Assured and Best-Effort), and ...

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

ABE: Providing a Low-Delay Service within best-effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We propose Alternative Best-Effort (ABE), a novel service for IP networks, which relies on the idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single class, best effort ...

2001

Video multicast over fair queueing networks

Martin Vetterli

We consider the problem of video multicast over networks that enforce fair bandwidth allocations in the routers. State-of-the-art layered IP multicast systems perform well for moderately sized sessions, but suffer from three basic problems that prevent the ...

2000

A Proven Delay Bound for a Network with Aggregate Scheduling

Jean-Yves Le Boudec

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and t ...

2000

Realisation of an Adaptive Audio Tool

Catherine Boutremans, Arnaud Meylan

Real-time audio over the best effort Internet often suffers from packet loss. At this time, Forward Error Correction (FEC) seems to be an efficient way to attenuate the impact of loss. Nevertheless to ensure efficiency of FEC, the source rate must be conti ...

2000

Realisation of an Adaptive Audio Tool

Catherine Boutremans, Arnaud Meylan

Real-time audio over the best effort Internet often suffers from packet loss. So far, Forward Error Correction (FEC) seems to be an efficient way to attenuate the impact of loss. Nevertheless to ensure efficiency of FEC, the source rate must be continuousl ...

2000

Holographic multiplexing in photorefractive polymers

Demetri Psaltis

A new multiplexing schedule is derived for multiplexing holograms in photorefractive polymers which do not exhibit mono-exponential recording behavior. An M-number (M/#) of 0.3 was measured experimentally by recording 20 holograms of roughly equal strength ...

2000