Publication

Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping

Publications associées (40)

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

Novel Oxygen Selective Complexes for Optical Oxygen Sensing

Michael Graetzel, Mohammad Khaja Nazeeruddin

Novel optical sensing films for oxygen based on highly luminescent iridium (III) and ruthenium (II) complexes have been developed. These demonstrate excellent long-term photostability (several months) when incorporated into polystyrene membranes. The influ ...

2007

High speed dynamics of photonic crystal nanocavity laser

Hatice Altug

We demonstrated high-speed photonic crystal nanocavity lasers with response time as short as similar to 2ps and direct modulation speeds exceeding 100GHz. Such high-speed characteristics are enabled by the use of cavity quantum electrodynamics effects such ...

IEEE2006

Dynamical plasma response during driven magnetic reconnection

Ambrogio Fasoli

Direct measurements of a collisionless current channel during driven magnetic reconnection are obtained for the first time on the Versatile Toroidal Facility. The size of the diffusion region is found to scale with the electron drift orbit width, independe ...

2003

Worst Case Burstiness Increase due to FIFO Multiplexing

Jean-Yves Le Boudec, Juan Echagüe

We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem arises in scenarios where aggregate multiplexing is performed, such as differe ...

2002

Worst Case Burstiness Increase due to FIFO Multiplexing

Jean-Yves Le Boudec, Juan Echagüe

2002

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Jean-Yves Le Boudec, Patrick Thiran

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum to ...

1999

We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter'' differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

A comparison of ABR and UBR to support TCP traffic

Jean-Yves Le Boudec

We compare the performance of ABR and UBR for providing high-speed network interconnection services for TCP traffic. We test the hypothesis that UBR with adequate buffering in the ATM switches results in better overall goodput for TCP traffic than explicit ...

1999

Connection Admission Control (CAC) algorithms are used to decide whether an incoming connection should be accepted or rejected in a node of a network offering reservation based services in order to maintain the guaranteed Quality of Service (QoS) in the ne ...

1999