Publication

The Asymmetric Best-Effort Service

Publications associées (107)

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

Heuristic Ramp-Metering Coordination Strategy Implemented at Monash Freeway, Australia

A new traffic-responsive feedback control strategy, heuristic ramp-metering coordination (HERO) that coordinates local ramp-metering actions in freeway networks is presented. The proposed coordination scheme is simple and reactive [i.e., based on readily a ...

National Academy of Sciences2011

Controlling Parallelism on Multi-core Software Routers

Mihai Dobrescu

Software routers promise to enable the fast deployment of new, sophisticated kinds of packet processing without the need to buy and deploy expensive new equipment. The challenge is offering such programmability while at the same time achieving a competitiv ...

2010

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

EDF-schedulability of synchronous periodic task systems is coNP-hard

Friedrich Eisenbrand, Thomas Rothvoss

In the synchronous periodic task model, a set \tau_1,...,\tau_n of tasks is given, each releasing jobs of running time c_i with relative deadline d_i, at each integer multiple of the period p_i. It is a classical result that Earliest Deadline First (EDF) i ...

2010

P2P video broadcast with latency and utility optimization

Pascal Frossard

We consider the problem of mesh-pull based video broadcast in peer-to-peer networks. We propose a novel algorithm for constructing the distribution overlay, where peers are arranged in neighborhoods that exhibit similar latency values from the origin media ...

2009

Performance Evaluation of Impulse Radio UWB Networks using Common or Private Acquisition Preambles

Jean-Yves Le Boudec, Ruben Merz

For impulse-radio ultra-wide band (IR-UWB) networks without global synchronization, the first step for correct packet reception is packet detection and timing acquisition: Before recovering the payload of the packet, the destination must detect that the pa ...

2009

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

Max-Olivier Hongler, Olivier Gallay

We propose a new real-time load sharing policy (LSP), which optimally dispatches the incoming workload according to the current availability of the operators. Optimality means here that the global service permanently requires the engagement of a minimum nu ...

2009

Optimizing TCP Receive Performance

Willy Zwaenepoel, Aravind Menon

The performance of the networking stack in an operating system depends on the overhead incurred by two of its components: the per-byte overhead incurred in data-touching operations, and the per-packet overhead of protocol processing and other operating sys ...

2008

Loss-resilient window-based congestion control

Pascal Frossard, Christophe De Vleeschouwer

This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window-based congestion control to support non-congestion related losses. We invest ...

2008

Loss and Delay Accountability for the Internet

Olga Irzak

The Internet provides no information on the fate of transmitted packets, and end systems cannot determine who is responsible for dropping or delaying their traffic. As a result, they cannot verify that their ISPs are honoring their service level agreements ...

2007

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010