Publication

A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators

Publications associées (38)

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

Safety-Liveness Exclusion in Distributed Computing

Rachid Guerraoui, Victor Bushkov

The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an a ...

ACM2015

On the Necessity of Traffic Shaping for PMU Measurement Data Streams

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Peng Gao, Miroslav Popovic

We study the communication network of an on-campus active distribution network (ADN) that comprises phasor measurement units (PMUs) connected to medium-voltage transformers. Within stringent time delays and with minimal loss the PMUs periodically transfer ...

2013

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

Adaptive Load Sharing for Network Processors

Jean-Yves Le Boudec

A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming t ...

2008

On Obstruction-Free Transactions

Rachid Guerraoui, Michal Kapalka

This paper studies obstruction-free software transactional memory systems (OFTMs). These systems are appealing, for they combine the atomicity property of transactions with a liveness property that ensures the commitment of every transaction that eventuall ...

ACM2008

On Obstruction-Free Transactions

Rachid Guerraoui, Michal Kapalka

2008

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in ...

Hindawi Publications2007

Packet Media Streaming with Imprecise Rate Estimation

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 ...

2007

An Accountability Interface 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

Boundedly generated groups with pseudocharacter(s)

Nicolas Monod

A note presenting the first examples of groups that are boundedly generated, have property (T) and have a one-dimensional space of pseudocharacters. ...

2006