Concept

Fair queuing

Related publications (69)

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.

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

A Novel Scheduler for a Low Delay Service Within Best-Effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of m ...

2001

A Novel Scheduler For a Low Delay Service Within Best-Effort

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

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

Toward a Formal Model of Fair Exchange - a Game Theoretic Approach

Jean-Pierre Hubaux, Levente Buttyan

A fair exchange protocol is a protocol, in which two (or more) mutually suspicious parties exchange their digital items in a way that neither party can gain an advantage over the other by misbehaving. Many fair exchange protocols have been proposed in the ...

2000

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

Toward a Formal Model of Fair Exchange, a Game Theoretic Approach

Jean-Pierre Hubaux, Levente Buttyan

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

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

How (Un)Fair are the ABR Binary Schemes, Actually?

Jean-Yves Le Boudec, Milan Vojnovic

It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max--min fairness. In this paper we show how the rates are distributed for the network con ...

1999