Publication

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Related publications (39)

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.

A Cost-Effective Method for the Detection of Queue Lengths at Traffic Lights

Currently, the comparatively young floating car technology is mostly used to get information about travel times which however are more attractive to navigation and route guidance. Concerning traffic management applications such as traffic light control, it ...

Springer2010

On Linear Arithmetic with Stars

Viktor Kuncak, Ruzica Piskac

We consider an extension of integer linear arithmetic with a star operator that takes closure under vector addition of the set of solutions of linear arithmetic subformula. We show that the satisfiability problem for this language is in NP (and therefore N ...

2008

Adaptive media streaming over multipath networks

Dan Jurca

With the latest developments in video coding technology and fast deployment of end-user broadband internet connections, real-time media applications become increasingly interesting for both private users and businesses. However, the internet remains a best ...

EPFL2007

Quality of Service Provided by Deficit Round Robin Algorithm

Nevena Vratonjic, Nevena Krsmanovic

In this paper we examine performance of the switches with output buffers for traffic with reservations and best-effort traffic. Packets are scheduled according to the Deficit Round Robin (DRR) algorithm. The DRR has been modeled, and quality of service in ...

2006

Creating Advanced Functions on Network Processors: Experience and Perspectives

In this paper, we present five case studies of advanced networking functions and how a network processor (NP) can provide high-performance and exible support for each of them. We first review the basic NP system architectures, and describe in more detail t ...

2003

HATS: Hierarchical Adaptive Transmission Scheduling for Multi-Application Adaptation

Willy Zwaenepoel

Applications running on a mobile wireless device most be able to adapt gracefully to limited and fluctuating network resources. When multiple applications run on the same device, control over bandwidth scheduling becomes fundamental in order to coordinate ...

2002

Bandwidth Allocation for Non-Responsive Flows with Active Queue Management

This paper addresses the problem of configuring active queue management systems (e.g. WRED and RIO) for service level specifications in Internetworks. In particular, we focus on Assured Forwarding (AF) for non-responsive flows in Differentiated Services ne ...

2002

A convergence theorem for controlled queues with partial observations

Razvan Cristescu

We consider a queuing problem in which both the service rate of a finite-buffer queue and its rate of arrivals are functions of the same partially observed Markov chain. Basic performance indices of this device, such as long term throughput and loss rates, ...

2002

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